Source: Calculus 1, Penn State University
Tags: nectar gathering model, optimal foraging theory, exponential function, Newton's method, rate optimisation, diminishing returns, bee foraging, calculus optimisation
Difficulty: Intermediate | Prerequisites: Derivatives, exponential functions, basic understanding of Newton's method
This topic sits at the intersection of calculus and behavioural ecology. It uses a concrete biological scenario, a bee deciding how long to stay on a flower, to motivate the kind of optimisation problem you will meet repeatedly in Calculus 1. The model brings together exponential functions, rates of change, and Newton's method in one worked example. You should already be comfortable differentiating exponential functions and understand the idea of setting a derivative equal to zero to find an optimum.
A bee collects nectar from a flower at a rate that slows over time (diminishing returns). To maximise its overall nectar intake per unit of time, including travel time between flowers, we build a rate function and use Newton's method to find the optimal time to leave. The answer: roughly 1.15 seconds per flower.
Nectar collection function, F(t)
The function F(t) = 1 - e^(-t), which models the total amount of nectar a bee has gathered after spending t seconds on a single flower. Think of it as a bucket that fills quickly at first, then slower and slower, never quite reaching full.
Diminishing returns
The principle that each additional second spent on a flower yields less new nectar than the second before it. In simple terms, the longer you stay, the less you gain for each extra moment.
Travel time, T
The average time the bee spends flying between flowers. In this model, T = 1 second. This is a fixed cost: it contributes nothing to nectar collection but must be accounted for in the total time budget.
Rate of nectar gathering, R(t)
The function R(t) = F(t) / (t + T), which gives the nectar collected per unit of total time (foraging plus travelling). In simple terms, this is the bee's overall efficiency, the payoff divided by the full time investment.
Newton's method
An iterative numerical technique for approximating roots of equations. Given a current guess t_n, the next guess is t_(n+1) = t_n - g(t_n) / g'(t_n). Think of it as repeatedly sliding down the tangent line to zero in on the answer.
Optimal foraging time, t*
The value of t that maximises R(t). Found by setting R'(t) = 0 and solving numerically. In this model, t* is approximately 1.1462 seconds.
Models nectar gathered after t seconds on one flower
As t increases, F(t) approaches 1 (the theoretical maximum) but never reaches it
The derivative F'(t) = e^(-t) is always positive but decreasing, which means the bee always collects more nectar by staying, but the rate of collection drops
At t = 0, F(0) = 0 (no time spent, no nectar). At t = 1, F(1) = 1 - e^(-1) ≈ 0.632
This is a classic saturating exponential, common in biology, chemistry, and engineering wherever a process has a natural ceiling
R(t) = (1 - e^(-t)) / (t + 1), with T = 1 second of travel time
The denominator (t + T) captures total cycle time: seconds on the flower plus seconds in transit
R(t) gives the average nectar yield per second of the entire forage-and-fly cycle
This is the function we want to maximise, because a bee that maximises R(t) collects the most nectar over a long foraging session
To maximise R(t), set R'(t) = 0
Differentiating R(t) using the quotient rule and simplifying leads to a condition that cannot be solved algebraically
The resulting equation to solve is g(t) = e^t - t - 2 = 0
Newton's method is applied: starting from an initial guess t_0, iterate t_(n+1) = t_n - g(t_n) / g'(t_n)
g'(t) = e^t - 1
The iteration converges to t* ≈ 1.1462 seconds
Interpretation: after about 1.15 seconds on a flower, the bee should leave and fly to the next one. Staying longer means the marginal nectar gain per second falls below what the bee could earn by starting fresh on a new flower.
F(t) = 1 - e^{-t}R(t) = \frac{F(t)}{t + T} = \frac{1 - e^{-t}}{t + 1}g(t) = e^{t} - t - 2 = 0 \quad \text{(condition for maximum of } R(t)\text{)}t_{n+1} = t_n - \frac{g(t_n)}{g'(t_n)} = t_n - \frac{e^{t_n} - t_n - 2}{e^{t_n} - 1}t^* \approx 1.1462 \text{ seconds}This model is a simplified version of the Marginal Value Theorem from optimal foraging theory, which ecologists use to predict how animals allocate time across food patches. The same mathematics appears in engineering and operations research: any situation where a resource is extracted with diminishing returns and there is a fixed switching cost (retooling a machine, changing a production batch, restarting a process) leads to the same trade-off.
Students often think maximising F(t) alone is the goal. It is not. F(t) approaches 1 as t grows, so spending forever on one flower would nearly maximise F(t), but the bee's overall efficiency would be terrible because travel time is wasted.
Students sometimes confuse F(t) with R(t). F(t) is total nectar from one flower; R(t) is nectar per unit of total time including travel. The optimisation is on R(t), not F(t).
A common error is to think Newton's method always converges. It does here with a reasonable starting guess, but in general convergence depends on the initial value and the behaviour of g(t).
Some students set F'(t) = 0 instead of R'(t) = 0. Since F'(t) = e^(-t) is never zero, this leads nowhere and is a sign the problem has been misread.
⚠️ Expect to be asked to derive R'(t) using the quotient rule and set it to zero. Know the quotient rule cold.
⚠️ Newton's method iterations are a favourite exam question. You may be given g(t) and asked to perform two or three iterations by hand from a given starting point.
⚠️ Interpreting the result matters: be ready to explain in words why t* ≈ 1.15 seconds is the optimal departure time, connecting marginal gain to opportunity cost.
⚠️ The equation e^t - t - 2 = 0 cannot be solved algebraically. If an exam question asks you to solve it, they want Newton's method (or a similar numerical approach), not an exact closed-form answer.
True or False: F(t) = 1 - e^(-t) can equal 1 for some finite value of t.
False. e^(-t) approaches 0 but never reaches it, so F(t) approaches 1 but never equals it.
Fill in the blank: R(t) divides nectar collected by ____.
Total cycle time (t + T), which includes both foraging time and travel time.
True or False: To find the optimal foraging time, we set F'(t) = 0.
False. We set R'(t) = 0, because we are optimising the rate function, not the collection function.
Fill in the blank: In Newton's method, each new guess is found by subtracting ____ from the current guess.
g(t_n) / g'(t_n)
True or False: If travel time T increased, the optimal time on each flower would also increase.
True. Higher travel cost makes it worth staying longer to extract more from each flower before paying the switching cost again.
Q: Write down the function R(t) and explain what each part represents.
A: R(t) = (1 - e^(-t)) / (t + 1). The numerator is the nectar collected from one flower after t seconds. The denominator is the total time for one foraging cycle: t seconds on the flower plus 1 second of travel. R(t) therefore gives nectar per second of the entire cycle.
Q: Why can we not solve e^t - t - 2 = 0 by hand?
A: The equation mixes an exponential term (e^t) with a polynomial term (-t - 2). There is no algebraic technique that isolates t in closed form for this combination, so a numerical method such as Newton's method is required.
Q: Perform one iteration of Newton's method on g(t) = e^t - t - 2, starting from t_0 = 1.
A: g(1) = e^1 - 1 - 2 = e - 3 ≈ -0.2817. g'(1) = e^1 - 1 ≈ 1.7183. So t_1 = 1 - (-0.2817 / 1.7183) ≈ 1 + 0.1639 ≈ 1.1639.
Q: Explain in plain language why there is an optimal time to leave a flower rather than staying as long as possible.
A: Each extra second on the flower yields less additional nectar (diminishing returns), but the bee has a fixed travel cost to reach the next flower. At some point, the nectar gained by staying one more second is less than what the bee could earn by flying to a fresh flower and starting over. The optimal departure time balances these two forces.
Q: If the travel time T were reduced to 0.5 seconds, would the optimal foraging time increase or decrease? Explain.
A: It would decrease. With lower travel cost, the penalty for switching flowers is smaller, so the bee benefits from leaving sooner and visiting more flowers per unit time.
This model connects directly to the quotient rule for derivatives, which you will use heavily in later optimisation problems. The diminishing-returns shape of F(t) = 1 - e^(-t) reappears in RC circuits (physics), drug absorption models (pharmacokinetics), and learning curves (psychology). Newton's method will return in Calculus 2 and numerical analysis courses as a foundational root-finding algorithm.
Optimal foraging theory, Marginal Value Theorem, Charnov model, nectar gathering, bee foraging optimisation, exponential saturation, saturating function, 1 - e^(-t), rate maximisation, quotient rule optimisation, Newton's method root finding, Newton-Raphson method, iterative approximation, diminishing marginal returns, foraging cycle, switching cost, calculus applied biology, MATH 140 Penn State, Calculus 1 writing assignment