Optimization, or finding the maximum or minimum value of a quantity given certain constraints, is a real-world application of the derivative tests. To figure out if you’re dealing with an optimization problem, look for the key words “maximum/minimum” or “largest/greatest/smallest/least.”
The following example will be a reference for the step-by-step process:
1. 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. We’ll label the dimensions as (length) and (width). The objective function is
2. Determine the constraint equation(s).
The rectangle is constrained by the area, which must be So the constraint equation is
3. Rewrite the objective function in terms of a single variable.
Do this by substituting the constraint into the objective function. It usually doesn’t matter which variable you rewrite it in. But if the question asked for “what length will minimize the perimeter?” it’d be better to rewrite in terms of to save a step later on. Rearranging the constraint equation,
Then
4. Find the extrema of the objective function
Since we’re trying to find where the perimeter is a minimum, this requires finding the critical point - the value of where the function might be an extrema. Differentiating,
Solving ,
Most optimization problems will involve real-world contexts (physical dimensions with length, area, volume, time, etc.). So negative values are meaningless and should be excluded from the domain. is the only critical point.
We can use the either the 1st or the 2nd derivative test to determine if results in a max or a min.
1st derivative test:
Test points around . The only limitation is that .
If is extremely large, will just be extremely small but the constraint can still be satisfied. It’ll just be an absurdly narrow rectangle.
| Interval | Sign of | behavior |
|---|---|---|
Because changes from negative to positive, there is a local minimum at .
2nd derivative test:
Because is always positive, is also always positive. So is always concave up and there is a local minimum at the critical number , which confirms the result from the 1st derivative test.
The conclusion is that a length of meters will result in the minimum perimeter. The question asked for the minimum perimeter so the answer is
Although optimization problems are not related rates problems, sometimes time can still be the input variable. The next problem involves a situation that changes over time but is an optimization problem because the objective is to optimize a function rather than find a rate.
2. 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?
1. Identify the objective function to optimize
The goal is to find at what time the distance between the two boats is at a minimum. So we’re trying to minimize the distance function.
Picture the boats on a coordinate plane. Boat Calculus starts at while Boat Achievable starts at .
Since distance = rate time, the position of Boat Calculus at any time is
while the position of Boat Achievable is
The distance between the two boats involves a right triangle, or the Pythagorean theorem/distance formula. The objective function is:
Minimizing is the same as minimizing . If we use the parabola as the objective function instead (with ), differentiating and finding critical points later will be easier.
2. Determine the constraint equation(s).
Unlike the previous problem with a rectangle of fixed area, there is no constraint or limitation. We’re simply tracking how the boats move to find when they’re closest.
3. Rewrite the objective function in terms of a single variable.
The objective function is already written in terms of one variable only - another reason why no constraint is needed.
4. Find the extrema of the objective function
To minimize the function (the square of the distance function), differentiate.
Solving ,
Let’s use the 2nd derivative test.
Since is always positive, is concave up and there is a relative minimum at the critical number . , the square of the distance function, is minimized, so the actual distance is also minimized The time at which the two boats are closest together is after . The minimum distance, plugging it into the distance function, is
For some optimization problems, you’ll also have to consider additional limitations. This will involve testing the endpoints of an interval with the extreme value theorem.
3. 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?
1. Identify the objective function to optimize
The goal is to optimize the total area. First, let’s define variables. Let the side length of the square be and each side of the triangle be
The area of the square is .
The area of the equilateral triangle is .
The function to optimize is the total area enclosed by the shapes:
2. Determine the constraint equation(s).
The 10 meter long wire becomes the sum of the perimeter of the shapes.
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.
It appears that rewriting the area function in terms of will be easier (to avoid dealing with the square root too much).
Rearranging the constraint equation,
Then the objective function rewritten is:
4. Find the extrema of the objective function
Differentiating,
Solving for ,
Multiplying both sides by the LCD of 8 to eliminate the fractions,
Either the 1st derivative or the 2nd derivative test can be used. Let’s go with the 2nd derivative test. From above,
Differentiating,
The 2nd derivative is always positive and is concave up, which means that the critical number we found for the side length of the triangle minimizes the total area.
In order to find the maximum, we have to test the endpoints of the interval, or what the smallest and largest values of can be. The side length of the triangle, , can’t be negative, but it can equal - it just means that all of the wire will be allocated to making the square.
If , then the area is
On the other hand, if all of the wire is used to make the triangle, then and each side of the triangle will have length . The area of this equilateral triangle is
Though it’s already known that the critical number that we found produces the minimum area, we can confirm this:
Comparing the three values found for the area shows that to maximize the total enclosed area, , which means all of the wire must go toward making the square.
To minimize the total enclosed area, . But that’s just the side length of the triangle. The portion of the wire to be cut was its perimeter:
So the wire should be cut into two pieces where the piece of length meters is bent into a triangle and the other piece of meters is bent into a square.
Sign up for free to take 5 quiz questions on this topic