Mathematics 21 Optimization Problems

First Semester AY 2019-2020 R. Corpuz

1. Express the number 11 as a sum of two nonnegative numbers whose product is as large as possible.
Let x and y be those two numbers. Then x + y = 11 ⇐⇒ y = 11 − x.
Goal. Maximize f (x, y) = xy or F (x) = x(11 − x) Constraints. x ∈ [0, 11]
Solving for critical numbers: Since F 0 (x) = 11 − 2x is continuous in R, we look for values of x so that
F 0 (x) = 0. But F 0 (x) = 0 ⇐⇒ 11 − 2x = 0 ⇐⇒ x = 11 2 . Comparing values,
 
11 11 11 121
F (0) = F (11) = 0 and F = · = ,
2 2 2 4
11 11
we see that F achieves its maximum when x = 2 . Consequently, y = 2 . Hence,

11 11
11 = 2 · 2 .

2. Find an equation of the tangent line to the curve y = x3 − 3x2 + 5x that has the least slope.
Let f (x) = x3 − 3x2 + 5x.
Goal. Minimize f 0 (x) = 3x2 − 6x + 5 Constraints. x ∈ R
Solving for critical numbers: Since f 00 (x) = 6x − 6 is continuous in R, we look for values of x so that
f 00 (x) = 0. But f 00 (x) = 0 ⇐⇒ x = 1. Since x ∈ (−∞, +∞), we study the limit as x → ±∞:

lim f 0 (x) = +∞ ⇒ no absolute maximum.

x→±∞

Notice that f (3) (x) = 6 > 0 so f (3) (1) > 0. By SDT, f 0 achieves it relative (and since it’s the only
one) and absolute maximum at x = 1. We set up the tangent line of f at x = 1: Passing through
(1, f (1)) = (1, 3) with slope f 0 (1) = 2, we have the line

` : y − 3 = 2(x − 1).

3. An open box is to be made from a 16-inch by 30-inch piece of cardboard by cutting out squares of
equal size from the four corners and folding up the sides. What size should the squares be to obtain a
box with the largest volume?

s s
s s

16

s s
s s
30

Let s be the length of the side of the square cuts.

Goal. Maximize V (s) = (16 − 2s)(30 − 2s)s = 4s3 − 92s2 + 480s Constraints. s ∈ (0, 8)
Solving for critical numbers: Since V 0 (s) = 12s2 − 184s + 480 is continuous in R, we look for values of
s so that V 0 (s) = 0. But V 0 (s) = 0 ⇐⇒ 12s2 − 184s + 480 = 0 ⇐⇒ 4(s − 12)(3s − 10) = 0 ⇐⇒
00
s = 12 or s
= 10 10
3 . Only s = 3 is valid under our constraints. We check that V (s) = 24s − 184
00 10
and V 3 = −104 < 0. By SDT, V achieves its relative (and since it’s the only one) and absolute
maximum at x = 10 3 . Hence,
10
s= 3 inches.

4. Find the radius and height of the right circular cylinder of largest volume that can be inscribed in a
right circular cone with radius 6 inches and height 10 inches.

1
 2r
10

6−r
6

Let r be the radius and h the height of the right circular cone.
Goal. Maximize v(r, h) = πr2 h Constraints. r ∈ (0, 6), h ∈ (0, 10)
Using similar triangles, we have
10 h 60 − 10r
= ⇐⇒ 60 − 10r = 6h ⇐⇒ h = .
6 6−r 6
60πr2 − 10πr3
 
2 60 − 10r
New goal. Maximize V (r) = πr = Constraints. r ∈ (0, 6)
6 6

0 1 2 2
Solving for critical numbers: Since V (r) = 6 120πr − 30πr = 20πr − 5πr is continuous in R, we
look for values of r so that V 0 (r) = 0. But V 0 (r) = 0 ⇐⇒ 20πr − 5πr2 = 0 ⇐⇒ r = 4. We check
that V 00 (r) = 20π − 10πr and V 00 (4) = −20π < 0. By SDT, V achieves its relative (and since it’s the
only one) and absolute maximum at r = 4. Hence,

10
r = 4 inches and h = 3 inches.

are the dimensions of the right circular cylinder with maximum volume that can be inscribed in a right
circular cone with radius 6 inches and height 10 inches.
5. Find the area of the largest rectangle having two vertices on the x-axis and two vertices above the
x-axis and on the parabola with equation y = 9 − x2 .

(0, 9)

2x x
−3 −2 −1 1 2 3

Let 2x be the measure of a side of the rectangle that lies on the x-axis and let y be the height of the
rectangle.
Goal. Maximize a(x, y) = xy Constraints. x ∈ (0, 3), y ∈ (0, 9)
Because (x, y) is a point on the parabola, it satisfies y = 9 − x2 which gives us a new function to
maximize.
New goal. Maximize A(x) = 2x(9 − x2 ) = 18x − 2x3 Constraints. x ∈ (0, 3)
Solving for critical numbers: Since A0 (x) = 18 − 6x2 is continuous in R, we look for
√ values of x so√that
A0 (x) = 0. But A0 (x) = 0 ⇐⇒ 18 − 6x2 = 0 ⇐⇒ 3 − x2 = 0 ⇐⇒ x = ± 3. Only x = 3 is

2
 √ √
admissible under our constraints for x. We check that A00 (x) = −12x and V 00 ( 3) = −12√3 < 0. By
SDT,√A achieves its relative (and since it’s the only one) and absolute maximum at x = 3. Hence,
x = 3 units and y = 6 units. So the largest possible volume is
√
V = 12 3 units2 .

6. An offshore oil well is located at a point W that is 5 kilometers from the closest point A on a straight
shoreline. Oil is to be piped from W to a shore point B that is 8 kilometers from A by piping it on a
straight line underwater from W to some shore point P between A and B and then on to B via pipe
along the shoreline. If the cost of laying pipe is around PHP 10,000,000 per kilometer underwater and
PHP 5,000,000 per kilometer over land, where should the point P be located to minimize the cost of
laying the pipe.

x 8−x
A P B

5 √
x2 + 25

Let x be the distance of P from A.√

Goal. Minimize C(x) = 10000000 x2 + 25 + 5000000(8 − x) Constraints. x ∈ (0, 8)
Solving for critical numbers:
2x 10000000x
C 0 (x) = 10000000 · √ + 5000000(−1) = √ − 5000000;
2
2 x + 25 x2 + 25
√
since x2 + 25 ≥ 5, C 0 is continuous in R. So we look for values of x so that C 0 (x) = 0:
10000000x
C 0 (x) = 0 ⇐⇒ √ = 5000000
x2 + 25
2x
⇐⇒ √ =1
2
x + 25
p
⇐⇒ 2x = x2 + 25
⇐⇒ 4x2 = x2 + 25
5
⇐⇒ 3x2 = 25 ⇐⇒ x = ± √ .
3
Take x = √5 since x is distance. We check the second derivative
3
√ x 
x2 + 25 − √
x2 + 25 
C 00 (x) = 10000000 

x2 + 25


and study  
r 
√5
 
00 5  1 100 3 

C √ = |10000000 · − .
 
3 {z }  100

3
q
100
3

>0 |{z} 3
>0

But r
√ 5
100 10 1
− q 3 = √ − > 0.
3 100 3 2
3

3
 √
√5 5 3
By SDT, C has its relative (and since it’s the only one) and absolute minimum at x = 3
= 3 km.
So
√
P should be 5 3 3 kilometers to the left of A.

7. A closed box with a square base is to have a volume of 2000 in3 . The material for the top and bottom
of the box costs PHP 30 per square inch and the material for the sides costs PHP 15 per square inch.
Find the dimensions of the box so that the total cost of material is least.

Let x be the length of the square base and y be the height of the box.
Goal. Minimize c(x, y) = 15 · 4 · xy + 30 · 2 · x2 = 60(xy + x2 ) Constraints. x, y ∈ (0, +∞)
2 2000
But the volume must be 2000 cubic  inches so x y = 2000
 ⇐⇒ y = x .
2

2000 2000
New goal. Minimize C(x) = 60 x · 2 + x2 = 60 + x2 Constraints. x ∈ (0, +∞)
x x

Solving for critical numbers: Since C 0 (x) = 60 − 2000 0
x2 + 2x we note that C ceases to exist when
x = 0. But x = 0 is not included in our constraints so we solve for x so that C 0 (x) = 0. But
C 0 (x) = 0 ⇐⇒ 2x − 2000

x2 = 0 ⇐⇒ 2x3 = 2000 ⇐⇒ x3 = 1000 ⇐⇒ x = 10. Since
00 2·2000 00 4000


C (x) = 60 x3 + 2 and C (10) = 60 1000 + 2 = 360 > 0, by SDT, C has a relative (and since
it’s the only one) and absolute minimum at x = 10. Hence, with

x = 10 inches and y = 20 inches,

the cost of manufacturing the box is least.

8. Director Claud decides to make a movie adaptation of The Little Prince. To get the best experience
inside the cinema during the movie premiere, she wants to determine where it is best to sit to get the
best view. If the cinema screen is 20 feet high and its bottom is 10 feet above eye level (while sitting),
how far is the director’s set from the front of the screen.

20

Ω 10
θ
x
 
30
We illustrate the situation above using a right triangle. Goal. Maximize Ω(x, θ) = tan−1 −θ
x
Constraints. x ∈ (0, +∞), θ ∈ 0, π2

4
 With SOHCAHTOA:
   
10 10 20 + 10 30
tan θ = ⇒ θ = tan−1 and tan(θ + Ω) = ⇒ θ + Ω = tan −1
.
x x x x
   
30 10
New goal. Maximize Ω(x) = tan−1 − tan−1 Constraints. x ∈ (0, +∞)
x  x  
1 30 1 10
Solving for critical numbers: Ω0 (x) = − 2 − − 2 . Since x is not within our
1 + 900
x2
x 1 + 100
x2
x
constraints, this is continuous on R so we only need to look for values x so that Ω0 (x) = 0. But
Ω0 (x) = 0 ⇐⇒ x2 +900 30 10
= x2 +100 ⇐⇒ 30x2 + 3000 = 10x2 + 9000 ⇐⇒ 20x2 = 6000 ⇐⇒ x2 =
√ √
300 ⇐⇒ x = ±10 3. Only x = 10 3 is within our constraints. We check the second derivative:
   
2x 2x 60x 20x
Ω00 (x) = 10 − 2 − 30 − = 2 − 2 .
(x + 100)2 (x2 + 900)2 (x + 100)2 (x + 100)2
Since √ √
√00 600 3 200 3
Ω (10 3) = − < 0,
12002 4002
√
by SDT, Ω achieves its maximum at x = 10 3. Therefore, the directors set should be
√
x = 10 3 feet away from the screen.

9. The product of two positive numbers m and n is equal to 9. Find the largest possible value of mn .
Goal. Minimize f (m, n) = mn Constraints. m, n ∈ (0, +∞)
But mn = 9 so m = n9 .

n
New goal. Minimize F (n) = n9 Constraints. n ∈ (0, +∞)
Solving for critical numbers: To get F 0 , we perform logarithmic differentiation:
     
9 1 dy 9 n 9 9
ln |y| = n · ln   ⇐⇒
  = ln   + n · · − 2 = ln   − 1
 
n y dn n 9 n n
 n    
dy 9 9
⇐⇒ F 0 (n) = = ln   − 1
dn n n
F 0 is only undefined when n = 0 which is not within our constraints

n so we solve for values n so that
F 0 (n) = 0. But note that since n > 0, we have n9 > 0 so that n9 > 0. So to compute for n that
makes F 0 (n) = 0, we only need to solve the equation
   
9 9 9 9
ln − 1 = 0 ⇐⇒ ln = 1 ⇐⇒ = e ⇐⇒ n = .
n n n e
Let us check the second derivative (product rule!):
 n       n    
9 9 9 9
F 00 (n) = Dn ln −1 + Dn ln −1
n n n n
 n    2  n  
9 9 9 n 9
= ln −1 + ·− 2
n n n 9 n
 n "    2 #
9 9 1
= ln −1 −
n n n
| {z }
α(n)

9 n
> 0, to study the sign of F 00 , we simply study the sign of α(n). So


Again since n
  
9 h
2 ei  e
sign F 00 = sign (ln e − 1) − = sign − < 0.
e 9 9

Thus, by SDT, F attains its maximum when n = 9e . Consequently, m = e. Thus, the larges possible
value of mn is
mn = e9/e ≈ 27.41.

5
10. A cylindrical container has a surface area of 12π ft2 . Determine the dimensions of the container such
that its volume is the largest possible.

2r

Let r be the radius of the base of the cylinder and let h be its height.
Goal. Minimize v(r, h) = πr2 h Constraints. r, h ∈ (0, +∞)
2 2 6−r 2
But the surface area must be 12π so 2πrh + 2πr = 12π ⇐⇒ rh + r = 6 ⇐⇒ h = r .
6−r 2
New goal. Minimize V (r) = πr2 r = 6πr − πr3 Constraints. r ∈ (0, +∞)
0 2
Solving for critical numbers: Since V (r) = 6π − 3πr , V is continuous in R, so we solve for values r√so
that V 0 (r) = 0. 0 2
√ But V (r) = 0 ⇐⇒ 6π − 3πr = 0 ⇐⇒ 6π = 3πr2 ⇐⇒ r√ 2
= 2 ⇐⇒ √ r = ± 2.
00 00
But only r = 2 is within our constraints. Now since V (r) = −6πr and V ( 2)√= −6 2π < 0, by
SDT, V has a relative (and since it’s the only one) and absolute minimum at r = 2. Hence, with
√ √
r= 2 feet and h = 2 2 feet,

the volume of the cylinder is largest.