Optimization
Optimization means finding the maximum or minimum value of a quantity while meeting certain constraints. It’s a common real-world application of derivative tests. You can usually spot an optimization problem by key words like maximum/minimum or largest/greatest/smallest/least.
General strategy
The following example will be a reference for the step-by-step process:
- What is the minimum perimeter of a rectangle that has an area of ?
1. Identify the objective function to optimize (what you’re trying to maximize or minimize).
The goal is to minimize the perimeter of the rectangle. Let the dimensions be (length) and (width). The objective function is
2. Determine the constraint equation(s).
The rectangle is constrained by its area, which must be . So the constraint equation is
3. Rewrite the objective function in terms of a single variable.
Do this by using the constraint to substitute for one variable in the objective function. It usually doesn’t matter which variable you choose. (If the question asked for the length that minimizes the perimeter, rewriting everything in terms of would save a step.)
Rearrange the constraint equation:
Now substitute into the perimeter formula:
4. Find the extrema of the objective function
To find where the perimeter is minimized, find the critical point(s) of (values of where or where is undefined). Differentiate:
Solve :
Because represents a length, we restrict to . So the only meaningful critical point is .
Now decide whether gives a maximum or a minimum. You can use either the 1st derivative test or the 2nd derivative test.
1st derivative test:
Test intervals around . The domain is .
| Interval | Sign of | behavior |
|---|---|---|
Because changes from negative to positive, has a local minimum at .
2nd derivative test:
Start with
Differentiate again:
For , we have , so is concave up on its domain. That means the critical point gives a local minimum, matching the 1st derivative test.
The question asks for the minimum perimeter, so evaluate at :
Even though optimization problems aren’t related rates problems, time can still be the input variable. The next problem changes over time, but it’s still optimization because the goal is to minimize a function, not to find a rate.
- Boat Achievable is due west of Boat Calculus a distance of 10 km away. Boat Achievable starts heading east at 3 km/hr at the same time that Boat Calculus heads north at 4 km/hr. At what time are the two boats closest together? What is the distance between them at this time?
Solution
1. Identify the objective function to optimize
The goal is to find when the distance between the two boats is as small as possible.
Place the boats on a coordinate plane. Let Boat Calculus start at and Boat Achievable start at .
Since distance = rate time, the position of Boat Calculus at time is
and the position of Boat Achievable at time is
Use the distance formula (from the Pythagorean theorem). The distance between the boats is
Minimizing is equivalent to minimizing , and the squared version avoids the square root. So we’ll minimize
2. Determine the constraint equation(s).
Unlike the rectangle problem, there’s no fixed constraint equation here. The motion of each boat is already built into the position formulas.
3. Rewrite the objective function in terms of a single variable.
The objective function is already in terms of one variable, .
4. Find the extrema of the objective function
Differentiate :
Solve :
Use the 2nd derivative test:
Since , is concave up and has a relative minimum at . Because , minimizing also minimizes .
So the boats are closest after
Now find the minimum distance:
For some optimization problems, you also have to consider additional limitations. In those cases, you’ll test endpoints of an interval using the extreme value theorem.
- You have a piece of wire 10 meters long and need to form a circle and/or a square. You can use the entire wire for a single shape or cut it and bend each piece into one of each shape. How should the wire be allocated to:
a) Maximize the total enclosed area?
b) Minimize the total enclosed area?
Solution
1. Identify the objective function to optimize
The goal is to optimize the total enclosed area.
Define variables: let the side length of the square be, and let each side of the equilateral triangle be .
The area of the square is .
The area of the equilateral triangle is .
So the total area is
2. Determine the constraint equation(s).
The 10-meter wire becomes the sum of the perimeters.
The perimeter of the square is .
The perimeter of the equilateral triangle is .
So the constraint equation is
3. Rewrite the objective function in terms of a single variable.
Rewriting in terms of keeps the algebra a bit simpler.
Rearrange the constraint equation:
Substitute into the area function:
4. Find the extrema of the objective function
Differentiate:
Solve :
Multiply both sides by 8:
Use the 2nd derivative test. From above,
Differentiate:
Since , is concave up, so the critical number gives a minimum total area.
To find the maximum, test the endpoints of the interval (the smallest and largest possible values of ).
The side length can’t be negative, but it can be (meaning all wire goes to the square).
If , then
If all the wire is used for the triangle, then and each side is . The area is
Evaluate the area at the critical value to confirm it’s the minimum:
Comparing these values:
- The maximum total area occurs at , so all the wire should be used to make the square.
- The minimum total area occurs at .
To describe the cut for the minimum-area case, convert to the triangle’s perimeter:
So cut the wire into two pieces:
- meters to form the triangle
- meters to form the square