Lagrange multipliers are an optimisation technique
under a constraint
particularly useful when it is impossible or difficult
to reduce the function to be optimised to a single variable function.
It forms the basis of the Lagrangian function.1
Statement
Given a function to be optimised ๐(โ๐ฏ)
and constraining function ๐(โ๐ฏ)=๐,
a maximising or minimising input โ๐ will satisfy
โ๐(โ๐)=๐โ๐(โ๐)
where ๐โ 0 is called the Lagrangian multiplier.
Multiple constraints
In the case of optimising ๐(โ๐ฏ)
under multiple constraints
The constraint ๐(โ๐ฏ)=๐ forms a Level set of ๐(โ๐ฏ).
Therefore any inputs to ๐ which satisfy the constraint
correspond to intersections of the level curve ๐(โ๐ฏ)=๐
and some level curve ๐(โ๐ฏ)=๐.
For any optimising (i.e. maximising or minimising) input of โ๐,
the two level curves will be tangent.
Since Gradient vectors are perpendicular to level curves,
this necessarily implies the the gradients โ๐(โ๐) and โ๐(โ๐) are parallel,
and hence there exists some nonzero ๐ such that2
โ๐(โ๐)=๐โ๐(โ๐)
Usage
In order to solve an optimisation problem using Lagrangian multipliers
with input of dimension ๐ (i.e. ๐:โ๐โโ),
one must solve a system of ๐+1 equations.
The lambda multiplier ๐ is not an arbitrary, meaningless value.
It is the derivative of the optimised value
with respect to the constraining value ๐
where ๐(โ๐ฏ)=๐ is the constraint.