Applications
How to solve optimization problems in calculus
To solve an optimization problem, write the quantity to make largest or smallest (the objective) as a formula, use the problem's condition (the constraint) to rewrite it in terms of one variable, and find that variable's sensible range. Then find the critical numbers and compare the objective's values there and at the endpoints. Answer the question that was asked, with units.
- Every optimization problem has an objective (what to maximize or minimize) and a constraint (a fixed condition).
- Use the constraint to write the objective in terms of a single variable before differentiating.
- Find the domain: the values of the variable that make physical sense.
- Compare the critical numbers with the endpoints; with no endpoints, a single critical number that is a local max or min is the absolute one.
What is an optimization problem?
Optimization means finding the best possible value: the largest area a fence can enclose, the least material that makes a can, the shortest route, the greatest profit. Mathematically, these are problems about the absolute maximum or minimum of a function. The calculus part is short; the real skill is turning the words into the right function.
Two words help organize every problem. The objective is the quantity you want to make as large or as small as possible. The constraint is a condition that can't change, such as a fixed length of fence or a fixed volume. The constraint is what links the variables together.
What are the steps for solving optimization problems?
- Understand and picture. Read carefully, and draw a diagram if there is any geometry.
- Name the quantities with letters, and decide which quantity is the objective.
- Write the objective as a formula. It may involve two or more variables at first.
- Use the constraint to write the objective in terms of one variable.
- Find the domain: which values of that variable make sense? Lengths can't be negative, for example.
- Find the absolute maximum or minimum on the domain: find the critical numbers, and compare the objective's values there and at the endpoints.
- Answer the question that was asked, with units. If it asks for dimensions, give dimensions, not just the area.
How do you maximize area with a fixed perimeter?
You have
- Name. Let the sides be
and meters. Objective: the area . - Constraint. All four sides use the fence:
, so and . - One variable.
. - Domain. Both sides must be at least
: . - Critical numbers.
gives . - Compare.
, , . The largest is , at , which makes .
Answer: A
How do you solve the open box problem?
An open-topped box is made from a
- Name. Let
be the side of each cut square, in inches. Folding up gives a box high with a square base of side (each edge loses at both ends). - Objective. Volume = base area × height:
. - Domain. The cut can't be negative, and two cuts can't exceed
: . - Differentiate with the product rule:
. - Factor out
: . - Critical numbers:
gives (an endpoint), and gives . - Compare.
, , and .
Answer: Cut
Differentiating before reducing to one variable. In the box problem,
What if there are no endpoints?
Sometimes the domain is an open interval, such as all
Why it works
- Suppose the single critical number
is a local minimum, but some other point had a smaller value. - Going from
toward , the graph first rises (since is a local minimum) and must later come back down below . - Turning from rising to falling would need a local maximum in between, which would be a second critical number. That's impossible, so
is the smallest value.
A cylindrical can must hold
- Name. Radius
, height , in cm. Objective: surface area (two circles plus the side, which unrolls into a rectangle by ). - Constraint. Volume
, so . - One variable.
, for (no endpoints). - Critical number.
gives , so and . - Check it's a minimum.
for , so it's a local minimum, and as the only critical number it's the absolute minimum. - Height.
. Since , this is .
Answer: Radius about
How do you find the shortest distance to a curve?
Distance involves a square root, which makes the derivative messy. A useful trick: the distance is smallest exactly where the distance squared is smallest, so minimize that instead.
Find the points on
- A point on the curve is
. Its distance squared from is . - Multiply out:
. , which is at and .- Compare:
, and . As , grows without bound, so the smallest value is . - At
, .
Answer: The closest points are
What are the most common mistakes in optimization problems?
- Skipping the domain and then reporting a critical number that makes no physical sense, like a negative length.
- Forgetting the endpoints, which can give the true maximum or minimum.
- Not checking that a critical number is a maximum (or minimum) rather than the opposite.
- Answering a different question: giving the area when the problem asked for the dimensions.
If a problem asks how fast something is changing at one moment rather than for the best possible value, it's a related rates problem instead.
Learn it step by step
The full lessons in the course explain this from the ground up, with graphs, worked examples, and practice problems that each have a complete worked solution.
Frequently asked questions
What is the first step in an optimization problem?
Read the problem, draw a picture, and name the quantities. Then identify the objective (what to maximize or minimize) and the constraint (the fixed condition).
Why do you need a constraint?
The objective usually involves two variables, and calculus here needs one. The constraint links them, so you can write one in terms of the other.
How do you know if you've found a maximum or a minimum?
Compare the objective's values at the critical numbers and endpoints, or use the first or second derivative test. With one critical number and no endpoints, a local max or min is the absolute one.
Do I need to check the endpoints?
Yes, whenever the domain is a closed interval. The largest or smallest value can be at an endpoint, where the derivative needn't be zero.
Why minimize distance squared instead of distance?
Because squaring doesn't change which point is closest (for positive distances, a smaller distance means a smaller square), and it removes the square root, making the derivative much simpler.