We know how to find stationary points of functions that are not subject to constraints - Solving f' = 0 and determining the nature of the turning point by checking f''.
But what if we seek to find stationary points of f subject to some constraint say, g = 0?
The straightforward solution is to incorporate the constraint g into f. For example, to find a turning point of f(x,y) = x2 + y2 subject to the constraint g(x,y) = 2x+y = 0, we could substitute y=-2x in f and work with f(x) = 5x2, giving us a minimum at x = 0.
But substitution of variables like the above is not always possible
and often leads to very complicated equations. For example, in the
above case, what if
? Then we get
and a really nasty function
Lagrange Multipliers provide an easier way to address this. Consider a
smooth scalar function of n independent variables
.
We know
where the
are unit vectors on xi axes.
Likewise if
is a constraint,
In order for
to have a stationary point on the surface
,
its gradient,
,
should be parallel to the
gradient of the surface,
.
Why? (Because the rate of
change of
on the level surface
must be zero)
Therefore at this point, each component of
must be
the
times the corresponding component of
,
where
is some constant.
Setting
,
(13) can be rewritten as:
which is exactly the condition for a stationary point of the function
And so we can try find a stationary point of
instead subject
to the constraint
.
Steps for applying Lagrange Multipliers to find stationary points of
subject to the constraint
In probability, the constraint function g is usually
We don't derive the following, but it is a straightforward extension of the above:
If there are m constraints,
,
then we use one multiplier for each, i.e. we get the equations