¡@
Lagrange Multipliers
Suppose we want to find the extreme values of
subject to a constraint
=
.
To maximize (minimize)
subject to
is to find the largest (smallest) value
such that the level curve
intersects
. It appears from the graph above that this happens when these curves just touch each other, that is, when they have a common tangent line. Otherwise,
will be increasing (decreasing) further.
![[Maple Plot]](images/suppl_LagrangeMultiplier12/suppl_LagrangeMultiplier12_001.jpg)
This means that the normal lines at the point (
) where they touch are identical. So the gradient vectors are parallel; that is,
for some scalar
Now let's take a look at the level curves.
![[Maple Plot]](images/suppl_LagrangeMultiplier16.gif)
![[Maple Plot]](images/suppl_LagrangeMultiplier17/suppl_LagrangeMultiplier17_001.jpg)
![[Maple Plot]](images/suppl_LagrangeMultiplier18.gif)
![[Maple Plot]](images/suppl_LagrangeMultiplier19.gif)
Now, if we want to maximize
subject to the constraint
=

To maximize ( minimize)
subject to
is to find the largest (smallest) value
such that the level surface
intersects
.
It appears from the graph below that this happens when these surfaces just touch each other, that is, when they have a common tangent plane. Otherwise
will be increasing (decreasing) further.
![[Maple Plot]](images/suppl_LagrangeMultiplier29/suppl_LagrangeMultiplier29_001.jpg)
This means that the normal lines at the point (
)where they touch are identical. So the gradient vectors are parallel; that is,
, f[y](x[0],y[0],z[0]), f[z](x[0],y[0],z[0])) = lambda*(g[x](x[0],y[0],z[0]), g[y](x[0],y[0],z[0]), g[z](x[0],y[0],z[0]))](images/suppl_LagrangeMultiplier31.gif)
for some scalar
.
![[Maple Plot]](images/suppl_LagrangeMultiplier33.gif)
Consider the problem of finding the maximum value
on the curve
of intersection of
=
and
=
.
Notice that the tangent vector of the curve
of intersection of
and
is perpendicular to the normal lines of both surfaces
and
. So the tangent vector of
at the point (
) is the normal vector of the plane generated by the vectors
(
)
and
(
)
To maximize
subject to the curve
of intersection of
and
is to find the largest value
such that the level surface
intersects the curve
. It appears from the graph below that this happens when the level surface
just touches the curve
. Otherwise
will be increasing further.
![[Maple Plot]](images/suppl_LagrangeMultiplier61/suppl_LagrangeMultiplier61_001.jpg)
This means that the normal vector to the level surface
is perpendicular to the tangent vector of the curve
at the point (
).
As we notice above the tangent vector of the curve
is the normal vector of the plane generated by the vectors
(
)
and
(
, h[y](x[0],y[0],z[0]), h[z](x[0],y[0],z[0])](images/suppl_LagrangeMultiplier68.gif)
So the gradient vector of
at the point (
) lies on the plane generated by the vectors
(
)
and
(
)
Thus, we have
, f[y](x[0],y[0],z[0]), f[z](x[0],y[0],z[0])) = lambda*(g[x](x[0],y[0],z[0]), g[y](x[0],y[0],z[0]), g[z](x[0],y[0],z[0]))+mu*(h[x](x[0],y[0],z[0]), h[y](x[0],y[0],z[0]), h[z](x[0],...](images/suppl_LagrangeMultiplier73.gif)
, f[y](x[0],y[0],z[0]), f[z](x[0],y[0],z[0])) = lambda*(g[x](x[0],y[0],z[0]), g[y](x[0],y[0],z[0]), g[z](x[0],y[0],z[0]))+mu*(h[x](x[0],y[0],z[0]), h[y](x[0],y[0],z[0]), h[z](x[0],...](images/suppl_LagrangeMultiplier74.gif)
for some scalars
and
.
Download Maple Worksheet