0% found this document useful (0 votes)
35 views4 pages

Week 12.2E Optimization

The document discusses four examples of optimization problems. The first two examples find the maximum area of a rectangle and maximum volume of a box given cost constraints. The third finds the minimum distance between a point on a parabola and another point. The fourth finds the shortest time for a person to travel between two points on opposite sides of a circular lake by walking or rowing.

Uploaded by

ludicksizwe1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
35 views4 pages

Week 12.2E Optimization

The document discusses four examples of optimization problems. The first two examples find the maximum area of a rectangle and maximum volume of a box given cost constraints. The third finds the minimum distance between a point on a parabola and another point. The fourth finds the shortest time for a person to travel between two points on opposite sides of a circular lake by walking or rowing.

Uploaded by

ludicksizwe1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Week 12

Topic 2. Optimization (Stewart, pp. 265 – 277)

1 General guidelines
In optimization problems situations will be described where we should find the “optimal” solution.
Here are general guidelines that could be followed.
1. Carefully read and understand what is asked.
2. Make a sketch, if possible.
3. Choose suitable variables and set up an equation which has to be maximized or minimized.
4. Determine a relationship between the variables and eliminate variables (if needed).
5. Create a function f of one variable and determine its domain (also take into account the
situation described!)
6. Determine an absolute maximum or minimum value of f .

2 Examples
Example 1. Determine the biggest area of a rectangle in the first quadrant which can fit under
the the parabola y = 4 − x2 .

Solution:
Make a sketch:
4

A y

−2 2

Formula for the area: The area is

A = xy

Further, the relationship between the height y and width x is y = 4 − x2 . According to the
sketch, x lies between 0 and 2. Thus the area is given by

A(x) = x 4 − x2 = 4x − x3 , where x ∈ [0, 2]




1
Maximum area: We use the Closed Interval Method:


′ 2 2 3
A (x) = 4 − 3x = 0 =⇒ x= ± √23 = ±233, but only + ∈ [0, 2]
3
We have
√ ! √   √
2 3 2 3 4 16 3
A(0) = A(2) = 0 and A = 4− =
3 3 3 9

16 3
Thus the biggest possible area of such a rectangle is 9 units2

Example 2. A carton box, without lid, with square basis and rectangular sides must be constructed
with a total cost of R48. The base costs R4/cm2 and each side costs R3/cm2 . Calculate the biggest
possible volume such a box can have.

Solution:
Sketch:
y where x is the length of the basis,
and y the height.
x
x
Formula for the volume:

Cost = 4 · basis + 3 · (4 sides)


=⇒ 48 = 4x2 + 3 · 4 · xy = 4x2 + 12xy
48 − 4x2 4 x
=⇒ y= = −
12x x 3
Consequently

Volume = x2 y where x, y ∈ (0, ∞)


 
4 x
=⇒ V (x) = x2 · − = 4x − 13 x3
x 3

Maximum volume:
dV
= 4 − x2 = 0 =⇒ x=2
dx
Notice that

V′ >0 op (0, 2)

V <0 op (2, ∞)

Thus, V obtain its maximum value when x = 2:

V (2) = 22 · 24 − 23 = 16 1

3 =5+ 3
16
Thus the largest volume of such a box is 3 cm3

2
Example 3. Determine the shortest distance amin between a point P (x, y) on the parabola y =
4 − x2 and the point P0 (0, −1). Give all possibilities for such points P (x, y) which gives is the
shortest distance.

Solution:
Sketch:
4
P (x, y)

a
2

P0 (0, −1)

Formula of the distance:


p p
Distance = a = (x − 0)2 + (y − (−1))2 = x2 + y 2 + 2y + 1

Since P (x, y) lies on the parabola, the relationship between x and y is

y = 4 − x2 =⇒ x2 = 4 − y

Thus
p p
a(y) = 4 − y + y 2 + 2y + 1 = y 2 + y + 5

Minimum distance:
2y + 1
a′ (y) = p
2 y2 + y + 5
1 2 3
y2 + y + 5 = y +

Notice that 2 +4+ 4 >0
Thus, the only critical number is 2y + 1 = 0 =⇒ y = − 12
Further,

a′ (y) < 0 for y < − 21 and a′ (y) > 0 for y > − 21

Consequently, a(y) has an absolute minimum at y = − 12 . Lastly


 
2 1 9 3
x =4− − = =⇒ x = ±√
2 2 2

19
Thus the minimum distance
 √ is 2 units.
 √ And the
 points on the parabola which is the
3 2 1 3 2 1
closest to (0, −1) is 2 , −2 and − 2 , −2 .

Example 4. A lady at a point A on the shore of a circular lake with radius 3 km wants to reach a
point C on the directly opposite side of the lake. She can walk at a rate of 6 km/h and row a boat
at a rate of 3 km/h.

3
(a) How long will it take her to walk to C?
(b) How long will she take to row to C?
(c) How must she proceed to reach C in the shortest possible time?

Solution: Sketch:

A C

1
distance 2 · 2π3 π
(a) Walk time = = = 2 h ≈ 1.57 h
speed 6
distance 6
(b) Row time = = = 2h
speed 3
(c) Sketch: Let B be the point between A and C on the shore, and let O be the midpoint of the
lake. Set ∠BAC = θ, then ∠BOC = 2θ and ∠ABC = π2 :
B

θ 2θ
A C
O

Formula of the total time:

row distance = AB = AC cos θ = 6 cos θ, en


π
walk distance = arc of BC = 3(2θ) = 6θ where 0 ≤ θ ≤ 2

Her total time is thus


6 cos θ 6θ
where θ ∈ 0, π2
 
T (θ) = Row time + Walk time = + = 2 cos θ + θ,
3 6

Shortest time:

T ′ (θ) = −2 sin θ + 1 = 0 =⇒ sin θ = 1


2 =⇒ θ= π
6

Plug in the critical numbers and boundary points and compare:

T (0) = 2 · 1 + 0 = 2 h
T π2 = 2 · 0 + π2 = π2 ≈ 1.57 ≈ 1 h 34 m

√ √
T π6 = 2 · 23 + π6 = 3 + π6 ≈ 2.26 ≈ 2 h 15 m


Thus, the shortest possible time is 1 h 34 min, which happens when she simply walks
from A to C.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy