Distance Optimization Problems
You'll learn how to find points that minimize the distance between objects, curves, or moving entities using calculus.
Core Idea
Distance optimization problems ask: "What's the shortest path?" or "What point gets us closest?" You might need to find the point on a curve nearest to a given location, or determine when two moving objects are closest together.
The key insight: distance formulas involve square roots, but we can optimize distance² instead (since minimizing √D also minimizes D when D ≥ 0). This eliminates messy square root derivatives!
The Strategy
- Set up the distance function using the distance formula:
D = √[(x₂ - x₁)² + (y₂ - y₁)²] - Square it to work with
D² = (x₂ - x₁)² + (y₂ - y₁)²(easier derivatives!) - Express in one variable using constraint equations (like a curve equation)
- Find critical points by taking the derivative and setting it to zero
- Verify the minimum using the first or second derivative test
Example Setup
To find the point on the parabola y = x² closest to (0, 1):
- Distance²:
D² = (x - 0)² + (x² - 1)² - Simplify:
D² = x² + x⁴ - 2x² + 1 = x⁴ - x² + 1 - Differentiate:
d(D²)/dx = 4x³ - 2x - Solve:
4x³ - 2x = 0gives critical points
Then test these points to find which gives minimum distance.
Key Takeaway: Distance optimization problems are solved by expressing distance (or distance squared) as a function of one variable, then using derivative techniques to find minimum values—making "closest point" questions purely mechanical.