Courses / Business I
Mathematics I

Calculus of Variations

Business I 247 words Free to read

Optimizing a Whole Path

Ordinary optimization picks the best number—a price or a batch size. The calculus of variations picks the best function: an entire path through time, because most real decisions are movies, not photographs.

The object being scored is a functional: a rule that eats a whole curve and returns one single number.

J[x]=0TF(t,x(t),x˙(t))dtJ[x] = \int_0^T F\big(t,\, x(t),\, \dot{x}(t)\big)\,dt

Here JJ is the functional score, tt is time, x(t)x(t) is the path, and x˙(t)\dot{x}(t) is its rate of change. Examples include production costs or lifetime utility. Changing the path anywhere alters the total score.

ConceptEatsReturnsExample
FunctionA numberA numberf(t)=3t2f(t) = 3t^2
FunctionalAn entire curveA numberTotal fuel J[x]J[x]

The Euler-Lagrange Equation

At an optimal path, no small deformation or variation can improve the score. Forcing this condition through the integral yields the Euler-Lagrange equation:

FxddtFx˙=0\frac{\partial F}{\partial x} - \frac{d}{dt}\frac{\partial F}{\partial \dot{x}} = 0

This differential equation dictates the optimal path at every instant, forcing global optimality through local perfection everywhere.

Economic applications: The Ramsey model splits output between consumption and investment over decades. It governs optimal advertising spend and finite resource extraction.

Common pitfall: Solving a path problem by optimizing each instant separately. The Euler-Lagrange logic is necessary because the best path balances across time; sprinting production today changes tomorrow's costs.
No small wiggle in the path improves its score -- shown as a literal

Practise this lesson

The explanation above is free to read. The graded practice for this lesson lives in the Tryals app.

13practice questions
2interactive scenes

Mathematics I