5.10 Introduction to Optimization Problems
- Syllabus
- 2020
- Topic
- 5.10
- Level
- —
An optimization problem asks for the greatest or least value of an objective quantity subject to constraints. Calculus begins only after the objective has been written as a function of one variable and its feasible interval has been identified.
For a rectangle with fixed perimeter P>0, let its sides be x and y. The constraint 2x+2y=P gives y=P/2−x. Therefore A(x)=x(2P−x),0≤x≤2P. Differentiate: A′(x)=P/2−2x, so the interior candidate is x=P/4. Then y=P/4. The endpoint areas are 0, while A(P/4)=P2/16, so the maximum area is P2/16 square units and occurs for a square.
Solving A′(x)=0 produces a candidate input, not automatically the requested optimum. Check that it is feasible, compare it with every required endpoint or other critical point, and distinguish the optimizing dimensions from the maximum or minimum value itself.