Optimization on Closed and Bounded Regions
You'll learn how to find absolute extrema by combining interior critical points with boundary analysis.
The Core Idea
When you're looking for the absolute maximum or minimum of a function on a closed and bounded region (like a disk or a rectangle in the plane), you can't just check critical points where the gradient is zero. Why? Because the extreme values might occur right on the edge of your region.
The Extreme Value Theorem guarantees that a continuous function on a closed and bounded region must have both an absolute maximum and an absolute minimum. Your job is to find them.
The Complete Strategy
Think of it like searching for the highest and lowest points in a fenced park: you need to check both the interior valleys and peaks and walk the entire fence line.
Step 1: Find all critical points inside the region where ∇f = 0 (or where partials don't exist).
Step 2: Examine the boundary of the region separately. This often means:
- Parameterizing the boundary curve(s)
- Substituting the boundary constraint into f to get a function of fewer variables
- Finding extrema along each boundary piece (using single-variable techniques or Lagrange multipliers)
Step 3: Evaluate f at all critical points (interior) and all candidate points (boundary).
Step 4: Compare all these values—the largest is your absolute maximum, the smallest is your absolute minimum.
Why This Works
The interior critical points capture "peaks" and "valleys" inside. The boundary analysis captures extrema that occur at the edges—places where the gradient might not be zero but where you simply can't go any further in that direction.
Key Takeaway: To find absolute extrema on a closed, bounded region, check all interior critical points and systematically analyze the entire boundary.