Optimization Problem: Find maximum or minimum values of a function subject to constraints.
- Identify variables and constraints
- Formulate objective function
- Express in terms of one variable
- Find critical points using derivatives
- Verify maximum/minimum using second derivative or endpoints
Rectangle inscribed in circle of radius 5: x² + y² = 100 (diagonal = diameter = 10)
y² = 100 - x² → y = √(100 - x²)
A(x) = x·√(100 - x²)
A'(x) = √(100 - x²) + x·(-2x)/(2√(100 - x²))
A'(x) = √(100 - x²) - x²/√(100 - x²) = (100 - x² - x²)/√(100 - x²) = (100 - 2x²)/√(100 - x²)
Setting A'(x) = 0: 100 - 2x² = 0 → x² = 50 → x = 5√2
y = √(100 - 50) = √50 = 5√2
Second derivative test confirms this is a maximum
The rectangle with maximum area is a square with sides of length 5√2, giving area = 50 square units.
• Constraint equation: Geometric relationship between variables
• Product rule: For differentiating A(x) = x·√(100 - x²)
• Critical points: Solve A'(x) = 0
• Maximum verification: Second derivative test or boundary analysis
Volume Optimization: Maximize V = length × width × height subject to material constraints.
Let x = side length of cut squares
Base dimensions: (24-2x) × (24-2x)
Height: x
V(x) = x(24-2x)² = x(576 - 96x + 4x²) = 576x - 96x² + 4x³
V'(x) = 576 - 192x + 12x²
Setting V'(x) = 0: 12x² - 192x + 576 = 0
Dividing by 12: x² - 16x + 48 = 0
Using quadratic formula: x = (16 ± √(256-192))/2 = (16 ± √64)/2 = (16 ± 8)/2
So x = 12 or x = 4
Since x < 12 (to keep positive dimensions), x = 4 is valid
Second derivative: V''(x) = 24x - 192
V''(4) = 96 - 192 = -96 < 0, confirming maximum
Base: (24-8) × (24-8) = 16 × 16
Height: 4
Maximum volume: V(4) = 4 × 16² = 1024 cubic inches
The box with maximum volume has base dimensions 16 × 16 inches and height 4 inches, giving a volume of 1024 cubic inches.
• Geometric modeling: Translate physical situation to mathematical function
• Quadratic formula: Solve V'(x) = 0
• Second derivative test: Confirm maximum (V''(x) < 0)
• Feasibility check: Ensure dimensions are physically meaningful
Time Minimization: Minimize total time T = distance₁/speed₁ + distance₂/speed₂
Let x = distance downstream from point directly across from A to landing point
Rowing distance: √(3² + x²) = √(9 + x²)
Running distance: 8 - x
T(x) = (rowing distance)/(rowing speed) + (running distance)/(running speed)
T(x) = √(9 + x²)/6 + (8 - x)/8
T'(x) = x/[6√(9 + x²)] - 1/8
Setting T'(x) = 0: x/[6√(9 + x²)] = 1/8
8x = 6√(9 + x²)
64x² = 36(9 + x²) = 324 + 36x²
28x² = 324
x² = 324/28 = 81/7
x = 9/√7 ≈ 3.4 km
Since T''(x) > 0 for x > 0, this is indeed a minimum
The man should land 9/√7 ≈ 3.4 km downstream from the point directly across from A
The man should land approximately 3.4 km downstream from the point directly across from A to minimize his travel time.
• Distance formula: Pythagorean theorem for rowing distance
• Time equation: Time = Distance/Speed
• Chain rule: For differentiating √(9 + x²)
• Algebraic manipulation: Solve rational equation involving radicals
Objective Function: The function to be maximized or minimized
Constraint: Equation that relates variables in the problem
Critical Point: Point where derivative is zero or undefined
Local Extremum: Local maximum or minimum value
Global Extremum: Absolute maximum or minimum over the domain
- Read carefully: Identify what needs to be optimized
- Define variables: Assign symbols to unknown quantities
- Write constraint: Find relationships between variables
- Formulate objective: Write function to optimize in terms of one variable
- Find critical points: Solve f'(x) = 0
- Verify extrema: Use second derivative test or check endpoints
- State answer: Provide complete answer with units
• First derivative test: Sign change in f' indicates local extrema
• Second derivative test: f''(c) < 0 for maximum, f''(c) > 0 for minimum
• Candidates: Critical points and endpoints of domain
• Global extrema: Compare all candidates
Surface Area Minimization: Minimize S = 2πr² + 2πrh subject to volume constraint.
Volume: V = πr²h = 1000 → h = 1000/(πr²)
S = 2πr² + 2πrh = 2πr² + 2πr·[1000/(πr²)] = 2πr² + 2000/r
S'(r) = 4πr - 2000/r²
Setting S'(r) = 0: 4πr = 2000/r²
4πr³ = 2000
r³ = 500/π
r = ∛(500/π)
h = 1000/(πr²) = 1000/[π·∛(500/π)²] = 1000/[π·(500/π)^(2/3)]
h = 1000/[π·500^(2/3)·π^(-2/3)] = 1000·π^(-1/3)/500^(2/3) = 2·500^(1/3)/π^(1/3) = 2·∛(500/π)
So h = 2r, meaning the height equals the diameter
S''(r) = 4π + 4000/r³ > 0 for r > 0, confirming minimum
The can with minimum surface area has radius r = ∛(500/π) ≈ 5.42 cm and height h = 2∛(500/π) ≈ 10.84 cm.
• Volume constraint: Express one variable in terms of another
• Surface area formula: S = 2πr² + 2πrh (including top and bottom)
• Power rule: For differentiating r^n terms
• Algebraic simplification: Manipulate radical expressions
Profit Function: P(x) = Revenue(x) - Cost(x), typically quadratic with negative leading coefficient.
P'(x) = -4x + 400
Setting P'(x) = 0: -4x + 400 = 0 → x = 100
P''(x) = -4 < 0, confirming x = 100 gives a maximum
P(100) = -2(100)² + 400(100) - 2000
P(100) = -20000 + 40000 - 2000 = 18000
Producing 100 thousand units maximizes profit at $18,000 thousand = $18 million
The company should produce 100 thousand units to maximize profit, achieving a maximum profit of $18 million.
• Quadratic functions: Maximum occurs at vertex x = -b/(2a)
• Business applications: Profit = Revenue - Cost
• Second derivative test: Negative second derivative confirms maximum
• Unit conversion: Carefully track units throughout calculation
Optimization Problem: Finding the maximum or minimum value of a function subject to constraints.
Objective Function: The function to be maximized or minimized (e.g., area, volume, profit).
Constraint: An equation that relates the variables in the problem (e.g., perimeter fixed, volume given).
Critical Point: A point where f'(x) = 0 or f'(x) does not exist.
Local Maximum: A point where function value is greater than nearby points.
Local Minimum: A point where function value is less than nearby points.
Global Maximum/Minimum: The highest/lowest value over the entire domain.
- Understand the problem: Read carefully, identify what is to be maximized/minimized
- Draw a diagram: Visualize the situation and label all variables
- Define variables: Assign symbols to unknown quantities
- Write constraint equation: Find relationship between variables
- Formulate objective function: Write the quantity to optimize in terms of one variable
- Find domain: Determine feasible values for the variable
- Find critical points: Solve f'(x) = 0
- Test critical points: Use first or second derivative test
- Check endpoints: If domain is closed and bounded
- State final answer: Include units and interpret in context
• First derivative test: Sign change from positive to negative indicates local maximum
• Second derivative test: f''(c) < 0 indicates local maximum, f''(c) > 0 indicates local minimum
• Candidates for extrema: Critical points and endpoints of the domain
• Global extrema: Compare all candidates to find absolute maximum/minimum
• Quadratic functions: Maximum occurs at vertex x = -b/(2a) when coefficient of x² is negative
Problem: Maximize area of rectangle with perimeter 20.
Solution: Let x, y be sides. Constraint: 2x + 2y = 20 → y = 10 - x
Area: A(x) = x(10 - x) = 10x - x²
A'(x) = 10 - 2x = 0 → x = 5
Since A''(x) = -2 < 0, this is a maximum.
Rectangle is a square: 5 × 5 with area 25.
Problem: Minimize cost of pipeline from point A to point B across a river.
Solution: Similar to Exercise 3, use distance formula and time minimization.
Key insight: Optimal path follows Snell's law of refraction in physics.
Minimizes total weighted distance: (water distance)/(water speed) + (land distance)/(land speed).
Questions & Answers
Question: How do I know whether a critical point is a maximum or minimum? Sometimes the second derivative test doesn't work.
Answer: You have several options to determine the nature of critical points:
- Second derivative test: If f''(c) > 0, then c is a local minimum; if f''(c) < 0, then c is a local maximum
- First derivative test: Examine the sign of f'(x) on either side of the critical point. If f' changes from positive to negative, it's a maximum; if from negative to positive, it's a minimum
- Boundary analysis: For closed intervals, compare function values at critical points and endpoints
- Contextual reasoning: In word problems, sometimes the physical situation tells you whether you expect a maximum or minimum
If f''(c) = 0, the second derivative test is inconclusive, so use the first derivative test or evaluate function values near the critical point.
Question: What if I have multiple variables in my optimization problem? Can I still use calculus?
Answer: Yes, but the approach depends on the number of variables:
- Single constraint: Use substitution to reduce to a single-variable problem (as shown in our exercises)
- Multiple constraints: In advanced calculus, use Lagrange multipliers
- Two variables: Find partial derivatives ∂f/∂x = 0 and ∂f/∂y = 0, then use the second partial derivative test
For Calculus 1, focus on reducing multi-variable problems to single-variable ones using constraints. This is exactly what we did in our exercises by expressing one variable in terms of another.
Question: Why do we need to check endpoints when optimizing? Don't critical points always give the maximum or minimum?
Answer: Critical points are only candidates for local extrema, but global extrema (absolute maximum/minimum) can occur at endpoints even when there are critical points inside the interval.
Consider this example: f(x) = x² on the interval [1, 3]. The critical point is at x = 0 (outside the interval), but the minimum occurs at x = 1 and the maximum at x = 3 (both endpoints).
When the domain is closed and bounded (like [a,b]), always compare function values at:
- All critical points inside the interval
- The left endpoint
- The right endpoint
The largest value is the global maximum, and the smallest is the global minimum.