Module 38: Multivariable extrema and constrained optimization
On this page
- A. Prerequisites and observable goals
- B. The central idea: allowed directions determine what an optimum means
- C. Interior and constrained tests
- D. Why the Hessian and multiplier conditions arise
- E. A candidate-comparison workflow
- F. Worked examples
- G. Independent practice
- H. Complete solutions: Module 38
- I. Retention and readiness
A. Prerequisites and observable goals#
Gradients, critical points, systems of equations, and single-variable optimization.
Classify regular critical points, inspect boundaries on compact regions, and use Lagrange multipliers without losing singular or boundary candidates.
B. The central idea: allowed directions determine what an optimum means#
At an unconstrained interior extremum of a differentiable function, every first-order directional change must vanish, so the gradient is zero. Under a constraint, only tangent directions are allowed. The gradient can be nonzero while pointing entirely normal to the constraint, making every permitted first-order change zero. This is the geometric basis of Lagrange multipliers.
C. Interior and constrained tests#
For a function of two variables at a critical point, set
If and , there is a local minimum; if and , a local maximum. If , the point is a saddle. If , this test is inconclusive. These are local conclusions; global extrema require the domain and boundary to be examined.
A continuous function on a compact region (closed and bounded in Euclidean space) attains maximum and minimum values. To find them, consider interior critical points, boundary curves or surfaces, corners, and any points where differentiability fails.
For a smooth equality constraint , at a constrained local extremum where , Lagrange’s necessary condition is
It provides candidates, not automatic winners. With multiple regular constraints, the objective gradient is a linear combination of their gradients; independence of constraint gradients matters. Singular constraint points and inequality boundaries need separate treatment. [O3Opt]
D. Why the Hessian and multiplier conditions arise#
At a critical point, the leading local change is governed by the quadratic expression , with a smaller-order remainder for a function. A positive definite quadratic expression makes all small changes positive; an indefinite one takes both signs and creates a saddle. The determinant test classifies this two-variable quadratic form.
On a regular constraint, tangent directions are perpendicular to . At an extremum, they must also be perpendicular to . For a single regular constraint, the normal direction is spanned by , so the two gradients are parallel. The multiplier is the scale relating them, not a new physical coordinate.
E. A candidate-comparison workflow#
State the feasible region. For an unconstrained problem, solve all partial derivatives equal to zero and check missing-derivative points. Classify with the Hessian only where its hypotheses hold; otherwise inspect signs or higher-order terms. For a compact region, add all boundary candidates before comparing objective values. For a constraint, solve the multiplier equations and the original constraint together, then inspect singular points and boundaries omitted by the regular equations. Confirm the final quantities satisfy the original constraints.
F. Worked examples#
An unconstrained quadratic. For , the gradient vanishes at . The Hessian has , , , so gives a local minimum. Completing squares gives , proving it is the unique global minimum, value .
A circle constraint. Maximize on . The multiplier equations imply . The constraint then gives with matching signs. Values are , so these are the maximum and minimum. Compactness guarantees extrema, and the nonzero circle gradient ensures the regular candidates cover them.
An inconclusive Hessian. The function has zero Hessian at the origin yet a strict minimum because all nearby nonzero values are positive. The function has the same zero Hessian there but a saddle. The zero determinant carries no classification by itself.
G. Independent practice#
F foundation C standard course work T transfer S optional stretch L runnable lab or project. Attempt the complete set before opening its solutions.
Find and classify the critical point of . Determine whether the classification is global.
Find and classify all critical points of .
Classify the origin for and , explaining why the second-derivative test is inconclusive.
Find absolute extrema of on the rectangle , . Include boundaries.
Use Lagrange multipliers to maximize and minimize on .
Find the point of the plane closest to the origin. Use a squared-distance objective and verify the constraint.
Among nonnegative with , maximize . Explain why a boundary point cannot be the maximizing point.
Minimize subject to . Show why the feasible point is an optimum even though no multiplier solves there.
Optional small hints
For M38.02, solve and before classifying. For M38.04, the boundary includes four line segments. For M38.08, inspect the nonzero-gradient hypothesis on the constraint.
H. Complete solutions: Module 38#
Compare the first step where your work differs. A corrected answer is not yet an independent success.
M38.01Show solution
A positive quadratic form gives a global conclusion
The gradient is , so the only critical point is . The Hessian test has and , a local minimum. Completing squares gives , proving the unique global minimum value is at . There is no global maximum on .
Back to M38.01M38.02Show solution
The same equation can have a saddle and a minimum
The gradient vanishes at and . Here , , , so . At , and , giving a local minimum of value . At , , giving a saddle of value . The cubic is unbounded above and below, so the local minimum is not a global one.
Back to M38.02M38.03Show solution
Use sign information when the Hessian vanishes
Both functions have zero first and second partials at the origin, so . For , whenever , giving a strict global minimum of zero. For , the axis values and show both signs arbitrarily nearby, hence a saddle. The inconclusive test is resolved by direct comparison.
Back to M38.03M38.04Show solution
The best values occur on the boundary
The function is continuous on a compact rectangle. Interior critical equations yield no interior point because is a boundary. On , . On , ranges from to . On , ranges from to ; on , ranges from to . Thus the absolute minimum is at and maximum at .
Back to M38.04M38.05Show solution
Solve the parallel-gradient equations and compare values
The equations are , , and . They force parallel to with length , giving points . Their objective values are . Thus the maximum is at and minimum at the opposite point. The circle is compact and regular, so these candidates suffice.
Back to M38.05M38.06Show solution
The minimizing vector is normal to the plane
Use . The multiplier equations give , so . The constraint becomes , so and the point is . Its distance is . For any other feasible point, the displacement from this point lies in the plane and is perpendicular to , so Pythagoras makes its squared distance plus a nonnegative term. This verifies the global minimum despite the unbounded constraint set.
Back to M38.06M38.07Show solution
Check the boundary before dividing by variables
The feasible triangle in the nonnegative octant is compact. Any boundary with one coordinate zero has product zero, while gives a positive product, so a maximum lies in the positive interior of the constraint. There the equations imply after division by positive factors. The sum constraint gives each equal to , and the maximum is . Boundary checking justified the divisions and ruled out missing maximizers.
Back to M38.07M38.08Show solution
A singular constraint invalidates the regular multiplier test
The only feasible point is , so it is both a constrained minimum and maximum, with value zero. But while . No scalar multiple of the zero vector equals . The multiplier theorem’s regularity assumption fails, so this is not a contradiction. Singular feasible points require direct inspection.
Back to M38.08I. Retention and readiness#
Retrieve M14.08 and M37.08. Explain why an interior derivative test cannot replace a boundary search and why a multiplier equation supplies candidates rather than proof of optimality. Complete Mixed Review R3 before beginning multiple integrals.