Optimizing with a constraint
Without constraints, a smooth function has its maximum or minimum where the gradient is zero, . Real problems come with constraints: a fixed budget, portfolio weights that must sum to 1, a risk limit. You are then looking for the best point on a curve or surface , not anywhere in the plane.
At the constrained optimum, the level curve of just touches the constraint, so the two gradients are parallel: . Package this as the Lagrangian and set all its partial derivatives to zero: the and equations give the parallel gradients and the equation gives back the constraint.
The multiplier has a meaning: it is the shadow price of the constraint, the rate at which the optimal value changes when the constraint is relaxed by one unit, . In a minimum-variance portfolio with weights summing to 1, it tells you how much variance a little more budget would buy.
Lab · what's graded
- The Lagrangian15 pts
- The optimal x20 pts
- The maximum value15 pts
- The multiplier15 pts
- The geometry10 pts
- A minimisation15 pts
- What the multiplier means10 pts