Example: Optimizing on a Curve in 3D
You'll learn how to find the maximum or minimum value of a function along a 3D curve defined by two simultaneous constraint equations.
The Setup
Imagine you're walking along a winding mountain path that's carved into the terrain. The path itself is constrained—you can't wander off it. Your goal is to find the highest or lowest point on that specific path.
In mathematical terms, you have:
- A function to optimize:
f(x, y, z)(like elevation) - Two constraint equations:
g(x, y, z) = 0andh(x, y, z) = 0
These two constraints together define a space curve (the intersection of two surfaces), not just a single surface.
Why Two Constraints?
In 3D, one constraint equation defines a surface. Two constraint equations define the curve where those two surfaces intersect. Think of it like the seam where two pieces of fabric meet—that seam is one-dimensional, a curve threading through 3D space.
The Method
You use the method with two constraints and introduce two Lagrange multipliers (λ and μ):
Set up the system:
- ∇f = λ∇g + μ∇h
- g(x, y, z) = 0
- h(x, y, z) = 0
This gives you five equations in five unknowns (x, y, z, λ, μ). The solutions give you candidate points on the curve where extrema occur.
Example Context
Find the point on the curve formed by the intersection of the sphere x² + y² + z² = 6 and the plane x + y + z = 0 that is closest to the origin.
Here, minimize f(x,y,z) = x² + y² + z² subject to both g = x² + y² + z² - 6 = 0 and h = x + y + z = 0.
Key Takeaway: When optimizing on a 3D curve, use two constraint equations with two Lagrange multipliers to find extrema along the intersection curve.