Optimization Problems

Core Idea

Optimization uses derivatives to find the maximum or minimum value of a quantity subject to constraints. The process involves translating a word problem into a function of one variable (using constraints to eliminate other variables), finding critical points, and verifying that the critical point gives the desired extremum. Applications include maximizing area, minimizing cost, maximizing volume, and optimizing distances.

How It's Best Learned

Follow a systematic process: draw a diagram, identify variables, write the objective function and constraint, reduce to one variable, differentiate, find critical points, verify with first or second derivative test, check endpoints if on a closed interval. Work many varied problems.

Common Misconceptions

• Forgetting to check endpoints of the domain (the absolute max/min may occur at an endpoint, not a critical point).
• Setting up the wrong objective function or misusing the constraint.
• Not verifying that a critical point is actually a maximum when a maximum is sought (or a minimum when a minimum is sought).

Explainer

When you studied derivatives, you learned that f′(x) = 0 at local maxima and minima. Optimization problems are the payoff: they ask you to use this fact to find the largest area, lowest cost, fastest time, or some other quantity in a real situation. The challenge is that real problems don't hand you a ready-made function — you have to build it from a description.

The process is systematic and non-negotiable: (1) draw a diagram and label variables, (2) identify the objective function (what you're maximizing or minimizing) and the constraint (a restriction relating your variables), (3) use the constraint to eliminate all but one variable, (4) differentiate and find critical points, (5) verify the type of extremum with a derivative test, and (6) check endpoints if the domain is bounded. Steps 3–6 are pure calculus; steps 1–2 are translation from words to algebra, and that's where most effort is required.

Step 3 is where students most often get stuck. Suppose you want to maximize the area A = xy of a rectangle with fixed perimeter 2x + 2y = 100. You have two variables, but the constraint gives you y = 50 − x. Substituting turns A = xy into A(x) = x(50 − x) = 50x − x², a function of one variable. Now A′(x) = 50 − 2x = 0 gives x = 25, and so y = 25 (a square maximizes area for fixed perimeter).

A critical misconception is thinking that finding a critical point means you're done. You still need to verify: is this a maximum or a minimum? A″(25) = −2 < 0 confirms a local maximum by the second derivative test. And if the domain is a closed interval — here 0 ≤ x ≤ 50, since side lengths must be non-negative — you must also compare the critical point value with endpoint values: A(0) = 0, A(25) = 625, A(50) = 0. The maximum is indeed 625 at the critical point, but this comparison is mandatory, not optional.

The variety of optimization problems can feel overwhelming — area, volume, cost, distance — but the structure is always the same. Every problem has one thing to optimize and at least one constraint. Your job is to translate the words into algebra, reduce to one variable, and apply the derivative machinery. Once you see that pattern, the problems become variations on a theme rather than separate puzzles.