Calculus I

Section 4.7
Optimization Solutions

Math 151 November 29, 2008

The following problems are maximum/minimum optimization problems. They illustrate one of the most
important applications of the first derivative. Many students find these problems intimidating because
they are ”word” problems, and because there does not appear to be a pattern to these problems. How-
ever, if you are patient you can minimize your anxiety and maximize your success with these problems
by following this strategy:

STRATEGY FOR SOLVING MAX/MIN OPTIMIZATION PROBLEMS

1. Read each problem slowly and carefully. Read the problem at least three times before trying to
solve it. Sometimes words can be ambiguous, so it is imperative to know exactly what the problem
is asking. If you misread the problem or hurry through it, you have NO chance of solving it
correctly.
2. If appropriate, draw a sketch/diagram of the problem to be solved. Pictures are a great help in
organizing and sorting out your thoughts.
3. Define variables to be used and carefully label your picture or diagram with these variables. This
step is very important because it leads directly/indirectly to the creation of mathematical equa-
tions.

4. Write down all equations that are related to your problem/diagram. Clearly denote the equation
which you are asked to maximize/minimize. Experience will show you that MOST optimization
problems will begin with two equations. One equation is a ”constraint” equation and the
other is the ”optimization” equation. The constraint equation is used to solve for one of the
variables. Then this is substituted into the optimization equation before differentiation occurs.
Some problems may have NO constraint equation. Some problems may have two or more constraint
equations.

5. Before differentiating, make sure that the optimization equation is a function on only one variable.
Then differentiate using the well-known rules of differentiation.

6. Verify that your result is a maximum/minimum value by using the 1st or 2nd derivative test for
extrema.

Exercise 1: Find the dimensions that will maximize the total area of a rectangular pen which is to
be built with three parallel partitions using 500 feet of fencing.
Let L represent the length in feet
and W the width in feet.
Maximize Area, A = LW Optimization Equation
From Perimeter, 2L + 5W = 500 Constraint Equation
2
Solve for W → W = 100 − 5L
sub. into Optimization Eqn.
W ¡ ¢
A(L) = L 100 − 5 L = 100L − 25 L2 , 0 < L < 250
2

Find A0 (L) = 0 → 100 − 45 L = 0 → L = 125

Since A00 (L) = − 45 < 0 for all L
Then L = 125 feet represents the maximum.
L
Maximum dimensions: Length 125 ft, Width 50 ft.
 Exercise 2: An open rectangular box with a square base is constructed from 48 square feet of
material. What dimensions will result in a box with the largest volume?
Let x represent the length (in ft.) of one side of the base and h the height (in ft.).
Volume, V = x2 h, to Maximize (”optimization equation”).
48 − x2 √
Surface area, A = x2 + 4xh = 48 (”Constraint Equation”) → h = , 0 < x < 48.
µ ¶ 4x
2 48 − x2 1 3
The optimization equation becomes, V (x) = x = 12x − x .
4x 4
3
Setting V 0 (x) = 0 −→ 12 − x2 = 0 −→ x2 = 16 → x = 4.
4
00 3 00
Since V (x) = − x −→ V (4) = −6 → Concave down for x = 4, verifying that at x = 4 is a maximum.
2
The maximum dimensions are x = 4 ft and h = 2 ft.

Exercise 3: A cylindrical can is to hold $20 π m3 . The material for the top and bottom costs $10
per m2 and the material for the sides costs $8 per m2 . Find the radius, r, and height, h, of the most
economical can.
Let r be the radius (in m) and h be the height (in m).
The Area of the cylinder, A = 2πr2 + 2πrh
The Cost to make the can, C = 10(2πr2 ) + 8(2πrh) = 20πr2 + 16πrh, (Equation to Minimize).
20π 20
The volume of the cylinder, πr2 h = 20π (Constraint Equation) → h = 2
= 2
µ ¶ πr r
2 20 2 320π
The optimization equation becomes, C(r) = 20πr + 16πr = 20πr + r .
r2
0 320π 3
Setting C (r) = 0 −→ 40πr − r2 = 0 −→ r = 8 → r = 2
Since C 00 (r) = 40π + 640π 00
r 3 → C (2) = + , Making the function Concave up for r = 2, so a minimum
exists at r = 2.
The minimum will exist when r = 2 m and h = 5 m.

Exercise 4: Car B is 30 miles directly east of Car A and begins moving west at 90 mph. At the
same moment Car A begins moving North at 60 mph. What will be the minimum distance between the
cars and at what time t does the minimum distance occur?
6
y
|| p
D(t) = (60t)2 + (30 − 90t)2
50t

30 − 90t ¾ x = 90t
car A car B
30 miles
p
Let t be the time in hours, then D(t) = (60t)2 + (30 − 90t)2 is the equation to minimize.
£ ¤−1/2
Finding D0 (t) yields, D0 (t) = 21 (60t)2 + (30 − 90t)2 {2(60t)(60) + 2(30 − 90t)(−90)}
0 3600t − 2700 + 8100t 11700t − 2700
D (t) = p =
2
(60t) + (30 − 90t) 2 (60t)2 + (30 − 90t)2
0 A 27
Want D (t) = 0, recall B = 0 → A = 0, thus 11700t − 2700 = 0 → t = 117 ≈ 0.23hrs.
To verify this yields a minimum, use the check the value of the first derivative on either side of .23hrs.
 1

q
D0 (t)
t
D0 (.1) = − .23 D0 (1) = +

The minimum occurs at t = .23hrs with minimum distance will be D(.23) ≈ 16.64 miles.

Exercise 5: A rectangular poster board is to contain 108 cm2 of printed material, with margins of
6 cm each at the top and bottom and 2 cm on the sides. What is the minimal cost of the poster if it is
to be printed on material costing .20 $/cm2 .
Let x and y represent the length and width of the printed material respectively in cm.

2 y 2
¾ x -
?

Area of the poster board, A = (x + 4)(y + 12) cm2 .

Cost of the poster board, C = .2A = .2(x + 4)(y + 12) $. This is the equation to minimize (optimization
equation).
108
Area of printed material is given as xy = 108 (constraint ¡ 108 equation).
¢ ¡ → y = x 432 ¢
Optimization equation becomes, ¡ C(x)¢ = .2(x + 4) x + 12 = .2 156 + 12x + x
432
Setting C 0 (x) = 0 ¡yields
¢ .2 12 − x 2 = 0 −→ x 2
= 36 → x = 6.
From C 00 (x) = .2 864x 3 and C 00
(6) = +, so the function is concave up at x = 6, thus a minimum cost
occurs when x = 6 cm and y = 18 cm. for the printed material.
Therefore, the dimensions of the poster board for the minimum cost are 10 cm by 30 cm.
 Exercise 6: Find the dimensions of the cylinder of maximum volume that can be inscribed in a
sphere of radius 1.
Let r and h be the radius and height of the inscribed cylinder.

1
h
2

Maximize the Volume of the cylinder V = πr2 h.

¡ ¢2 h2
We also know from pythagorean theorem r³2
+ h2 ´ = 1, (constraint equation), → r2 = 1 − 4 .
h2 πh3
Optimization equation becomes, V (h) = π 1 − 4 h = πh − 4 .
2
Setting V 0 (h) = 0 yields π − 3πh = 0 → h2 = 43 → h = √23 .
³ 4´
From V 00 (h) = 3πh2 and V
00 √2
3
= −, the the function is concave down at h = √2
3
and a maximum
exists. q
The volume will be a maximum when h = √23 and r = 23 .
 Exercise 7: Two posts, one is 12 ft. high and the other is 28 ft. high are placed 30 ft. apart. They
are to be stayed by 2 wires attached to a single stake running from ground level to the top of each post.
Where should the stake be placed to use the least wire?
Let x represent the distance to place the stake from the 12 foot post.

28
D2 (x)

12 D1 (x)

x 30 − x
¾ 30 -

√ p
The distance to the stake D1 (x) = 122 + x2 and D2 (x) = (30 p − x)2 + 282 ,
√
total distance of the wire, D(x) = D1 (x) + D2 (x) = 12 + x + (30 − x)2 + 282 . Find D0 (x) = 0.
2 2
¡ ¢−1/2 ¡ ¢−1/2
D0 (x) = 12 122 + x2 {2x} + 12 (30 − x)2 + 282 {2(30 − x)(−1)}
0 x x − 30
D (x) = √ +p
122 + x2 (30 − x)2 + 282
D0 (x) = 0
x 30 − x
√ =p
122 + x2 (30 − x)2 + 282
p p
x (30 − x)2 + 282 = (30 − x) 122 + x2
¡ ¢ ¡ ¢
x2 (30 − x)2 + 282 = (30 − x)2 122 + x2
x2 (30 − x)2 + x2 282 = (30 − x)2 122 + (30 − x)2 x2
28x = (30 − x)12
28x = 360 − 12x
40x = 360
x=9

Let’s find the sign of the first derivative on either side of x = 9.

1

q
D0 (x)
9 x
D0 (7) = − D0 (10) = +
Thus to use the minimum amount of wire the state should be placed 9 feet from the 12 foot post.