- 1.
- Understand how the method of Lagrange multipliers works both algebraically and geometrically.
- 2.
- Be comfortable finding critical points using the method of Lagrange multipliers.
Recap Video
The following video recaps the ideas of the section.
_
To recap:
Suppose and are differentiable functions. If has a maximum or
minimum on the constraint curve (where is any number) at the point , and
if , then
for some constant (called the Lagrange multiplier).
Example Video
Below is a video working through an example of Lagrange multipliers.
Problems
Find the maximum and minimum values of the function on the ellipse .
First
notice that this is a filled in ellipse (because it is , not ). The region isis
not
closed and bounded, which means the global maximum and minimum values
areare not
guaranteed to exist. However, Lagrange multipliers only helps on the
boundary, so we first need to deal with the inside of the ellipse.
- Find critical points inside the ellipse: Do this by setting . Here,
Can this ever equal ? Yes NoTherefore, there areare not critical points inside the region.
- Deal with the boundary: The boundary is , which now looks like ,
where and . We now set . This means
This gives us three equations:
The goal is to accumulate all simultaneous solutions to these three
equations. The multiplier is just there to help you in case you need
it.
- Approach 1: One way to solve these equations is to solve for in the first two equations. Looking at the first equation, can ? YesNo . Therefore, we can divide by in the first equation, which gives . Looking at the first equation, can ? YesNo . Therefore, we can divide by in the second equation to get . We can then get in terms of , and so we have . Plugging this into the constraint gives , so . Since , we get two points: These are all the critical points. Now plugging in these points into shows that we have a maximum value of: and a minimum value of: .
- Approach 2: We could also solve for and in terms of if we wanted to. Looking at the first equation, can ? YesNo . Therefore, we can divide by in the first equation and in the second equation to get Plugging these into the constraint equation gives Solving for gives . Using our equations for and in terms of give the points and . Therefore, our two critical points are and , as before. We can now plug these into to find the same maximum and minimum values as in the other approach.
Find the maximum value of the function on the ellipse .
Now, the region is
just the ellipse, not filled in. The region is still closed and bounded,
but now there is no interior to check. Therefore, Lagrange is enough
to figure this out. The constraint looks like , where and . We set ,
or
This gives us three equations
You may already have your own way for solving this, but we will show you
two approaches.
- Approach 1: We can solve for in each of the first two equations. As in the previous problem, we should check whether the variables can be before dividing. For the first equation, if , then we see , which doesdoes not work in the last equation. This tells us that cancannot equal . Following the same logic for the second equation tells us cannot be . Therefore, we can divide the first equation by and second by to get Cross multiplying and simplifying gives us We can now plug this into our constraint to get Solving for gives . Since , we can solve for with each of these values, giving us a total of four critical points. The critical points are
- Approach 2: We could also just multiply the first equation by to get and second by to get Therefore . If , then equation eq:1 tells us and equation eq:2 tells us , which again does not work in in equation eq:3. Therefore, we can divide by to get , or . Now we repeat the steps from Approach 1 above to get the four critical points.
Plugging in all four points into gives us a maximum value of .
Find the maximum and minimum values of the function on the sphere .
The maximum value is and the minimum value is: .
The maximum value is and the minimum value is: .
Find the maximum and minimum value of the function on the circle using
Lagrange multipliers.
The maximum is: and the minimum is: .
The maximum is: and the minimum is: .