Math 103 – Rimmer

4.7 Optimization

4.7 Optimization
 Math 103 – Rimmer
4.7 Optimization

4.1

4.1
 Math 103 – Rimmer
Fall 2007 Final Exam 4.7 Optimization

constraint
A = x ( y + 60 ) 300 = y + x + ( y + 60 ) + x

A = x (120 − x + 60 ) 300 = 2 y + 2 x + 60
240 − 2 x = 2 y
A = x (180 − x )
y = 120 − x
A = 180 x − x 2 ⇒ y = 30
set
smallest x = 1
A′ = 180 − 2 x = 0
largest x = 120 Dimensions of the pen
⇒ 2 x = 180
x A( x) ⇒ x = 90 90′ × 90′
1 179 Absolute Max.

90 8100 A ( 90 ) = 90 ⋅ 90

7200 A (120 ) = 120 ⋅ 60

120
 Math 103 – Rimmer
4.7 Optimization

A poster has printed material in the middle and a border around it. The poster must
contain 60 sq. cm. of printed material. The left and right margins should be 5 cm.,
the top and bottom margins should be 3 cm. What should be the dimensions of the
printed material in order to minimize the amount of paper used for the poster?
constraint
must

3 A = ( x + 10 )( y + 6 ) A = xy = 60
poster printed
x material

 60  60
A = ( x + 10 )  + 6  y=
printed
poster
 x  x
y 600
material
A = 60 + 6 x + + 60 smallest x = 1
x largest x = 60
5 5 A = 120 + 6 x + 600 x −1
3 A′ = 6 − 600 x −2 x A( x)
600
A (1) = 11⋅ 66 A ( 60 ) = 70 ⋅ 7
600 set 6= 1 726
6− 2 =0 x2
A (10 ) = 20 ⋅12 x
2 10 240
6 x = 600
Dim. of pr. mat. 490
2
x = 100
Absolute Min. 60
10cm. × 6cm.
⇒ x = 10
 Math 103 – Rimmer
A box with a square base and an open top must have a volume of 4.7 Optimization

4000 cubic cm. Find the dimensions of the box that minimize the amount
of material being used.
constraint
must
2
A=

x + 4

xy V = x 2 y = 4000
base 4 sides
y 4000
 4000  y= 2
A = x2 + 4x  2  x
 x 
x
A = x 2 + 16000 x −1 4000 4000
4000
x ⇒y= 2
=
20 400
A′′ = 2 + 32000 x −3 A′ = 2 x − 16000 x −2
⇒ y = 10
A′′ is always positive 16000 set
2x − 2
=0
A is always concave up x
16000 Dimensions of box
A is continuous for x > 0 = 2x
x 2 20cm. × 20cm. ×10cm.
The local min. at x = 20 x3 = 8000
is actually an absolute min.
⇒ x = 20
 Math 103 – Rimmer
2 2 4.7 Optimization
Find the points on the ellipse 4 x + y = 4 that are furthest away
from the point (1,0) .
General ellipse equation Distance from ( x, y ) to (1, 0 )
x2 y 2 2 2
+ =1 d= ( x − 1) + ( y − 0 )
a 2 b2 b
2

−a
d= ( x − 1) + y2
a
Instead of maximizing the distance d , we maximize its square D = d 2
2
−b D = ( x − 1) + y 2 The constraint comes from the fact that
x y 2 2 the point ( x, y ) is on the ellipse.
4x + y = 4 ⇒ +
2 2
=1 2
1 4 D = ( x − 1) + 4 − 4 x 2 4 x2 + y 2 = 4 ⇒ y2 = 4 − 4 x2

D′ = 2 ( x − 1) − 8 x smallest x = −1
set
2 x − 2 − 8x = 0 largest x = 1
−1
−6 x = 2 ⇒x=
3 x D ( x)
y 2 = 4 − 4 ( 19 ) = 329 −1 4
4 2 48 Abs. Max.
⇒ y=± −1
3 3 9
 −1 4 2   −1 −4 2 
 ,
3 3
 and  ,
3 3
 1 0
    2 48
D ( −31 ) = ( −34 ) + 4 − 94 = 169 + 329 =
9
 Math 103 – Rimmer
A Norman window has the shape of a rectangle surmounted by a 4.7 Optimization
semi-circle. If the perimeter of the window is 30 ft., find the value of
x so that the greatest possible amount of light is admitted.

A = xy + π
2
x 2
( )
2
constraint
window
30 = x + y + y + 12 ( 2π x
2 )
x 2
2 A = xy + π8 x
y
A = x (15 − 12 x − π4 x ) + π8 x 2
30 = x + 2 y + π2 x
A = 15 x − 12 x 2 − π4 x 2 + π8 x 2 30 − x − π2 x = 2 y
A = 15 x − ( 12 + π8 ) x 2 y = 15 − 12 x − π4 x
A = 15 x − ( 4+8π ) x 2
set A′′ = − ( 4+4π )
A′ = 15 − ( 4+4π ) x = 0
A′′ is always negative
15 = ( 4+4π ) x
A is always concave down
60
x= 4 +π
A is continuous for x > 0
60
The local max. at x = 4 +π

is actually an absolute max.