4.3 Lagrange Multipliers
Most optimization in practice comes with a leash: maximize , subject to . The leash changes everything. A constrained maximum is almost never at a critical point of itself — our specimen has only a saddle, no maximum at all — yet on the constraint circle the problem has clean, finite answers. The question is where to look, and the figure answers it twice over: once on the map, once along a ribbon.
Explore in 3D (opens in a new tab)Explore
- Orbit to a low side view and follow the red ribbon once around. How many crests and how many troughs does it have? Note roughly where the crests sit over the dark circle.
- A crest is where , walking along the constraint, stops increasing and starts decreasing — it stalls. What is the ribbon's slope, measured along the walk, at a stall?
- The ribbon's height over the circle is . Using symmetry — the product is largest where and are equal and share a sign — predict the exact coordinates of the two crests and the value of there. Commit before revealing.
- Reveal the two hidden points with their eye toggles. They sit at the crests; zoom in and read their positions against the grid. Do they match your , ?
- Now the map view: orbit to look straight down and drag the contour plot's z-offset from up to . The whole family of level curves rides up the saddle as one sheet. As it reaches crest height, the curve meets the circle at exactly the two marked points — does it cross the circle there, or kiss it tangentially?
- Drag the z-offset back to about and look at where meets the circle: four honest crossings. Check against the ribbon — over those four points, is it at a crest, or still climbing? Say the connection out loud: crossing a level curve means the walk is still changing . (The 17 levels put drawn curves exactly at the integer values , so both curves in this step and the last are actually drawn; other level counts can hide them.)
From kiss to equations
At a tangency the constraint curve and the level curve share a tangent line, so their normals point along one line. Those normals are gradients — for the level curve, for the constraint — so at a constrained extremum
for some scalar , the Lagrange multiplier, solved together with . The logic runs through step 6: where the level curve crosses the constraint, level curves of larger and smaller value lie on either side, so sliding along the constraint still changes — no extremum there. Only a kiss can stop the walk, and the ribbon says the same thing in its own language: kisses on the map are stalls on the ribbon.
The pivot of the example: eliminating and from the Lagrange equations leaves (written here with for ), whose two roots hand back the lines and and, with the constraint, all four kiss points.
An original work of XYZ Homework, built around interactive XYZ 3D figures. Aligned to OpenStax Calculus Volume 3 (Strang & Herman), © OpenStax (Rice University), licensed CC BY-NC-SA 4.0; no OpenStax content is reproduced, and this work is not affiliated with or endorsed by OpenStax or Rice University. License: CC-BY-NC-SA-4.0.