Absolute extrema on a closed region and Lagrange multipliers
You learn to find the absolute largest and smallest values of a function on a closed and bounded region (interior critical points + boundary), and to solve extremum problems under a constraint with Lagrange multipliers.
Last week’s second derivative test finds only local extrema. But in practice most questions ask “what is the highest and lowest value in this region?” or “what is the best value under this constraint?”. This week we answer these two questions. In the first (absolute extrema on a closed region) we scan the inside and the boundary of the region separately and compare the candidates. In the second (Lagrange multipliers) we find the candidates without solving the constraint, using the condition that the gradients are parallel. The exam has one big question from each; points are lost mostly by skipping a piece of the boundary or a solution case.
Golden rules:
- On a closed and bounded region, a continuous function always has an absolute max and min (Extreme Value Theorem).
- Candidates: interior critical points + critical points on the boundary + vertices.
- For absolute extrema the test is not needed. Just compare the values.
- Lagrange: and . Before dividing, examine separately the factors that could be zero.
Absolute extrema: the closed region method
The region must be closed (it includes its boundary) and bounded (it does not go to infinity). A disk, a rectangle and a triangle are typical examples.
Method.
1) INTERIOR: solve f_x = 0, f_y = 0. Keep only the points that lie inside the region.
2) BOUNDARY: treat each edge separately.
line segment → substitute y (or x), a single-variable function
→ set the derivative to 0 (roots inside the interval) + the two endpoints of the edge
circle x²+y²=r² → substitute x² = r² - y², or x = r cos t, y = r sin t
3) TABLE: write all the candidates and the f values. Choose the largest and the smallest.
Example 1. , the triangle with vertices , , .
Interior. , : . , inside. .
Edge 1, , . , : , . Ends: , .
Edge 2, , . , : . Ends: and .
Edge 3, . : . : , the point , . The ends are already vertices.
| Candidate | |
|---|---|
| interior | |
Absolute max , at . Absolute min , at .
PITFALL · forgetting the vertices. When you reduce each edge to a single-variable function, the endpoints of that edge are candidates too. Since the endpoints are vertices, the easiest way is to compute the values at the vertices at the very start and write them in the table. In this example the maximum came out at a vertex, and no derivative zero gave it.
Lagrange multipliers
Problem. Find the largest and smallest values of on the constraint (a curve). In three variables the constraint is a surface: .
Theorem. At an extremum point of on the constraint (and if ) there is a number such that
In two variables these are three equations (, , ) in three unknowns (). In three variables, four equations in four unknowns.
Intuition. Imagine walking along the constraint curve and crossing the level curves of . As long as you cross a level curve, is increasing or decreasing. At an extremum the constraint curve is tangent to the level curve of . If two curves are tangent, their normals are parallel. The normals are the gradients: . is the coefficient of parallelism.
Example 2. , constraint .
∇f = <y, x>, ∇g = <2x, 2y>
y = 2λx (1)
x = 2λy (2)
x² + y² = 8 (3)
Multiply (1) by x and (2) by y: xy = 2λx² and xy = 2λy² → λx² = λy²
If λ = 0, then from (1),(2) x = y = 0, which does not satisfy (3) → λ ≠ 0, so x² = y²
(3): 2x² = 8, x = ±2, y = ±2 → four points
f(2,2) = f(-2,-2) = 4, f(2,-2) = f(-2,2) = -4
Max , min . The constraint is a circle (closed and bounded), both values certainly exist.
Tactics for solving the system
| Tactic | When |
|---|---|
| Dividing the equations to eliminate | If what you divide by cannot be zero |
| Multiplying each equation by , , and equating | In product functions like |
| Factoring and “either or …” | If a variable stands as a factor in every equation |
| Symmetry | If and do not change under , try the candidate (do not assume it is the only one) |
TIP · zero cases. In an equation like , before cancelling write the case separately. In Q9 the branch produces two candidates with the value . Even if they are neither the min nor the max, they must be in the list of candidates; skipping them leaves the solution incomplete.
Example 3 (three variables). The largest value of on the sphere . , so . Constraint: , . Max , min .
Lagrange or substitution?
If you can easily pull a variable out of the constraint (a line, a plane), last week’s substitution method works too. Lagrange’s advantage: when the constraint is complicated (a circle, an ellipse, ) it gives a symmetric system without taking roots and without splitting cases. In closed-region questions, if the boundary is a circle or an ellipse you can examine the boundary with Lagrange and the interior with .
Common mistakes
| Wrong | Correct |
|---|---|
| Taking a critical point outside the region as a candidate | Take only those inside the region |
| Skipping one edge of the boundary | Each edge is separate; write it in the table |
| Forgetting the vertices | Vertices are always candidates |
| Doing the test for absolute extrema | Unnecessary; compare the values |
| In Lagrange, dividing by and losing | First examine the zero case separately |
| Giving as the answer | The answer is the point and the value |
| Taking the only point found as both the max and the min | Compare all candidates; on an unbounded constraint one of them may not exist |
| Forgetting to add the constraint equation to the system | is one of the equations too |
Test yourself
Exam-style questions. Solve them on paper first, then reveal the answer.
Find the absolute maximum and minimum of on the closed disk .
Show answer
Interior: , : , inside the disk, .
Boundary: on , , . The largest is at , the smallest is at .
Candidates: , , . Absolute max at , absolute min at .
Find the absolute extrema of on the triangle with vertices , , .
Show answer
is never zero, so there is no interior critical point. A linear function has no critical points along the boundary edges either; the extrema are at the vertices., , .
Find the absolute extrema of on the rectangle , .
Show answer
Interior: , , a vertex (on the boundary).: . : .: , at it is ; the ends are , . : , at it is ; the ends are , .
Among all candidates the largest is at , the smallest is at .
Use Lagrange multipliers to maximize subject to .
Show answer
: , , so . From the constraint .. (The constraint is an unbounded line; there is no minimum, can be as negative as you like.)
Find the maximum and minimum of on the circle .
Show answer
: , , so .
Constraint: , . The points are and ., . The circle is closed and bounded, both values are absolute.
Find the minimum of subject to .
Show answer
: , . Multiply: ; since , .: , , and . : , , no solution.. (There is no maximum: the hyperbola goes to infinity.)
Find the maximum volume of a rectangular box in the first octant with three faces on the coordinate planes and one vertex on the plane .
Show answer
, . : , , .
Multiply each equation by , , respectively: , that is, .
Constraint: , , , . .
Find the point on the plane closest to the origin.
Show answer
(the square of the distance). : , , .
Constraint: , . The point is , the distance is .
(The closest point is the point reached by dropping from the origin along the normal direction to the plane.)
Find the maximum and minimum of on the ellipse .
Show answer
. First: , so or .: , .: the second equation gives . Constraint: , , ., . Candidates : max , min .
Find the absolute extrema of on the disk .
Show answer
Interior: , . Boundary: , , .
The largest is at , the smallest is at . Candidates , , .
Find the minimum of subject to .
Show answer
: . Constraint: , .
The value is .
Find the absolute extrema of on the closed triangle , , .
Show answer
Interior: , : , on the boundary (not an interior point).: . : , .: , ; critical : at ; end : .
The largest is , the smallest is .
Verification: Absolute extrema were checked with a dense grid scan over the whole region (interior and boundary), Lagrange results with a parametric scan of the constraint curve (circle, ellipse, hyperbola, line, sphere), and the condition ∇f ∥ ∇g with numerical gradients in node (verify/MAT1052/12.mjs).