Vous êtes sur la page 1sur 67

Section 4.

5 Optimization Problems
V63.0121.002.2010Su, Calculus I
New York University

June 14, 2010

Announcements The midterm is graded! Quiz 4 Thursday on 4.14.4 Guest speaker on Thursday: Arjun Krishnan . . . . . .

Announcements

The midterm is graded! Quiz 4 Thursday on 4.14.4 Guest speaker on Thursday: Arjun Krishnan

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

2 / 31

Objectives

Given a problem requiring optimization, identify the objective functions, variables, and constraints. Solve optimization problems with calculus.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

3 / 31

Outline

Leading by Example

The Text in the Box

More Examples

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

4 / 31

Leading by Example

Example What is the rectangle of fixed perimeter with maximum area?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

5 / 31

Leading by Example

Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

5 / 31

Leading by Example

Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle.

. .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

5 / 31

Leading by Example

Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle. w . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

5 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w. This is a function of two variables, not one. But the perimeter is fixed.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w. This is a function of two variables, not one. But the perimeter is fixed. p 2w Since p = 2 + 2w, we have = , 2

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w. This is a function of two variables, not one. But the perimeter is fixed. p 2w Since p = 2 + 2w, we have = , so 2 A = w = 1 1 p 2w w = (p 2w)(w) = pw w2 2 2 2

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w. This is a function of two variables, not one. But the perimeter is fixed. p 2w Since p = 2 + 2w, we have = , so 2 A = w = 1 1 p 2w w = (p 2w)(w) = pw w2 2 2 2

Now we have A as a function of w alone (p is constant).

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Continued
Let its length be and its width be w. The objective function is area A = w. This is a function of two variables, not one. But the perimeter is fixed. p 2w Since p = 2 + 2w, we have = , so 2 A = w = 1 1 p 2w w = (p 2w)(w) = pw w2 2 2 2

Now we have A as a function of w alone (p is constant). The natural domain of this function is [0, p/2] (we want to make sure A(w) 0).
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

6 / 31

Solution Concluded
We use the Closed Interval Method for A(w) = At the endpoints, A(0) = A(p/2) = 0. 1 pw w2 on [0, p/2]. 2

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

7 / 31

Solution Concluded
We use the Closed Interval Method for A(w) = 1 pw w2 on [0, p/2]. 2

At the endpoints, A(0) = A(p/2) = 0. dA 1 To find the critical points, we find = p 2w. dw 2

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

7 / 31

Solution Concluded
We use the Closed Interval Method for A(w) = 1 pw w2 on [0, p/2]. 2

At the endpoints, A(0) = A(p/2) = 0. dA 1 To find the critical points, we find = p 2w. dw 2 The critical points are when 0= 1 p p 2w = w = 2 4

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

7 / 31

Solution Concluded
We use the Closed Interval Method for A(w) = 1 pw w2 on [0, p/2]. 2

At the endpoints, A(0) = A(p/2) = 0. dA 1 To find the critical points, we find = p 2w. dw 2 The critical points are when 0= 1 p p 2w = w = 2 4

Since this is the only critical point, it must be the maximum. In this p case = as well. 4

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

7 / 31

Solution Concluded
We use the Closed Interval Method for A(w) = 1 pw w2 on [0, p/2]. 2

At the endpoints, A(0) = A(p/2) = 0. dA 1 To find the critical points, we find = p 2w. dw 2 The critical points are when 0= 1 p p 2w = w = 2 4

Since this is the only critical point, it must be the maximum. In this p case = as well. 4 We have a square! The maximal area is A(p/4) = p2 /16.
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

7 / 31

Outline

Leading by Example

The Text in the Box

More Examples

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

8 / 31

Strategies for Problem Solving

1. Understand the problem 2. Devise a plan 3. Carry out the plan 4. Review and extend

Gyrgy Plya (Hungarian, 18871985)


. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

9 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram. 3. Introduce Notation.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram. 3. Introduce Notation. 4. Express the objective function Q in terms of the other symbols

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram. 3. Introduce Notation. 4. Express the objective function Q in terms of the other symbols 5. If Q is a function of more than one decision variable, use the given information to eliminate all but one of them.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

The Text in the Box

1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram. 3. Introduce Notation. 4. Express the objective function Q in terms of the other symbols 5. If Q is a function of more than one decision variable, use the given information to eliminate all but one of them. 6. Find the absolute maximum (or minimum, depending on the problem) of the function on its domain.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

10 / 31

Polya's Method in Kindergarten


Name [_

Problem Solving Strategy Draw a Picture


Kathy had a box of 8 crayons. She gave some crayons away. She has 5 left. How many crayons did Kathy give away?
UNDERSTAND

What do you want to find out? Draw a line under the question.

You can draw a picture to solve the problem.

crayons
CHECK

What number do I add to 5 to get 8? 8 = 5 5 + 3 = 8

Does your answer make sense? Explain. Draw a picture to solve the problem. Write how many were given away. I. I had 10 pencils. I gave some away. I have 3 left. How many pencils did I give away?
What number do I add to 3 to make 10?
ft
ft I '' I I

ft

13 ill

:i i? 11

I I

V63.0121.002.2010Su, Calculus I (NYU)

U U ~7 Section 4.5 Optimization Problems

H 11 M i l

U U> U U

June 14, 2010

11 / 31

Recall: The Closed Interval Method


See Section 4.1

The Closed Interval Method To find the extreme values of a function f on [a, b], we need to: Evaluate f at the endpoints a and b Evaluate f at the critical points x where either f (x) = 0 or f is not differentiable at x. The points with the largest function value are the global maximum points The points with the smallest/most negative function value are the global minimum points.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

12 / 31

Recall: The First Derivative Test


See Section 4.3

Theorem (The First Derivative Test) Let f be continuous on (a, b) and c a critical point of f in (a, b). If f changes from negative to positive at c, then c is a local minimum. If f changes from positive to negative at c, then c is a local maximum. If f does not change sign at c, then c is not a local extremum.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

13 / 31

Recall: The First Derivative Test


See Section 4.3

Theorem (The First Derivative Test) Let f be continuous on (a, b) and c a critical point of f in (a, b). If f changes from negative to positive at c, then c is a local minimum. If f changes from positive to negative at c, then c is a local maximum. If f does not change sign at c, then c is not a local extremum. Corollary If f < 0 for all x < c and f (x) > 0 for all x > c, then c is the global minimum of f on (a, b). If f < 0 for all x > c and f (x) > 0 for all x < c, then c is the global maximum of f on (a, b).
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

13 / 31

Recall: The Second Derivative Test


See Section 4.3

Theorem (The Second Derivative Test) Let f, f , and f be continuous on [a, b]. Let c be in (a, b) with f (c) = 0. If f (c) < 0, then f(c) is a local maximum. If f (c) > 0, then f(c) is a local minimum.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

14 / 31

Recall: The Second Derivative Test


See Section 4.3

Theorem (The Second Derivative Test) Let f, f , and f be continuous on [a, b]. Let c be in (a, b) with f (c) = 0. If f (c) < 0, then f(c) is a local maximum. If f (c) > 0, then f(c) is a local minimum. Warning If f (c) = 0, the second derivative test is inconclusive (this does not mean c is neither; we just dont know yet).

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

14 / 31

Recall: The Second Derivative Test


See Section 4.3

Theorem (The Second Derivative Test) Let f, f , and f be continuous on [a, b]. Let c be in (a, b) with f (c) = 0. If f (c) < 0, then f(c) is a local maximum. If f (c) > 0, then f(c) is a local minimum. Warning If f (c) = 0, the second derivative test is inconclusive (this does not mean c is neither; we just dont know yet). Corollary If f (c) = 0 and f (x) > 0 for all x, then c is the global minimum of f If f (c) = 0 and f (x) < 0 for all x, then c is the global maximum of f
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

14 / 31

Which to use when?


Pro
CIM no need for inequalities gets global extrema automatically only for closed bounded intervals 1DT works on non-closed, non-bounded intervals only one derivative Uses inequalities More work at boundary than CIM 2DT works on non-closed, non-bounded intervals no need for inequalities More derivatives less conclusive than 1DT more work at boundary than CIM

Con

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

15 / 31

Which to use when?


Pro
CIM no need for inequalities gets global extrema automatically only for closed bounded intervals 1DT works on non-closed, non-bounded intervals only one derivative Uses inequalities More work at boundary than CIM 2DT works on non-closed, non-bounded intervals no need for inequalities More derivatives less conclusive than 1DT more work at boundary than CIM

Con

Use CIM if it applies: the domain is a closed, bounded interval If domain is not closed or not bounded, use 2DT if you like to take derivatives, or 1DT if you like to compare signs.
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

15 / 31

Outline

Leading by Example

The Text in the Box

More Examples

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

16 / 31

Another Example

Example (The Best Fencing Plan) A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

17 / 31

Solution
1. Everybody understand?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

18 / 31

Another Example

Example (The Best Fencing Plan) A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

19 / 31

Another Example

Example (The Best Fencing Plan) A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions? Known: amount of fence used Unknown: area enclosed

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

19 / 31

Another Example

Example (The Best Fencing Plan) A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions? Known: amount of fence used Unknown: area enclosed Objective: maximize area Constraint: fixed fence length

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

19 / 31

Solution
1. Everybody understand?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

20 / 31

Solution
1. Everybody understand? 2. Draw a diagram.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

20 / 31

Diagram
A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800 m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions?

.
.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

21 / 31

Solution
1. Everybody understand? 2. Draw a diagram.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

22 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

22 / 31

Diagram
A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800 m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions?

.
.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

23 / 31

Diagram
A rectangular plot of farmland will be bounded on one side by a river and on the other three sides by a single-strand electric fence. With 800 m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions? . w . . .

.
.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

23 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

24 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p. 4. Q = area = w.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

24 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p. 4. Q = area = w. 5. Since p = + 2w, we have = p 2w and so Q(w) = (p 2w)(w) = pw 2w2 The domain of Q is [0, p/2]

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

24 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p. 4. Q = area = w. 5. Since p = + 2w, we have = p 2w and so Q(w) = (p 2w)(w) = pw 2w2 The domain of Q is [0, p/2] dQ p 6. = p 4w, which is zero when w = . dw 4

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

24 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p. 4. Q = area = w. 5. Since p = + 2w, we have = p 2w and so Q(w) = (p 2w)(w) = pw 2w2 The domain of Q is [0, p/2] dQ p 6. = p 4w, which is zero when w = . dw 4

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

24 / 31

Solution
1. Everybody understand? 2. Draw a diagram. 3. Length and width are and w. Length of wire used is p. 4. Q = area = w. 5. Since p = + 2w, we have = p 2w and so Q(w) = (p 2w)(w) = pw 2w2 The domain of Q is [0, p/2] dQ p 6. = p 4w, which is zero when w = . Q(0) = Q(p/2) = 0, but dw 4 Q (p) 4 =p p2 p2 p 2 = = 80, 000m2 4 16 8
. . . . . .

so the critical point is the absolute maximum.


V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 24 / 31

Your turn
Example (The shortest fence) A 216m2 rectangular pea patch is to be enclosed by a fence and divided into two equal parts by another fence parallel to one of its sides. What dimensions for the outer rectangle will require the smallest total length of fence? How much fence will be needed?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

25 / 31

Your turn
Example (The shortest fence) A 216m2 rectangular pea patch is to be enclosed by a fence and divided into two equal parts by another fence parallel to one of its sides. What dimensions for the outer rectangle will require the smallest total length of fence? How much fence will be needed? Solution Let the length and width of the pea patch be and w. The amount of fence needed is f = 2 + 3w. Since w = A, a constant, we have f(w) = 2 The domain is all positive numbers.
. . . . . .

A + 3w. w

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

25 / 31

Diagram

w .

. . f = 2 + 3w A = w 216

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

26 / 31

Solution (Continued)
We need to find the minimum value of f(w) = 2A + 3w on (0, ). w

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

27 / 31

Solution (Continued)
We need to find the minimum value of f(w) = df 2A = 2 +3 dw w 2A which is zero when w = . 3 We have 2A + 3w on (0, ). w

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

27 / 31

Solution (Continued)
We need to find the minimum value of f(w) = We have 2A + 3w on (0, ). w

df 2A = 2 +3 dw w 2A which is zero when w = . 3 Since f (w) = 4Aw3 , which is positive for all positive w, the critical point is a minimum, in fact the global minimum.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

27 / 31

Solution (Continued)
We need to find the minimum value of f(w) = We have 2A + 3w on (0, ). w

df 2A = 2 +3 dw w 2A which is zero when w = . 3 Since f (w) = 4Aw3 , which is positive for all positive w, the critical point is a minimum, in fact the global minimum. 2A So the area is minimized when w = = 12 and 3 3A A = = = 18. The amount of fence needed is w 2 ( ) 2A 3A 2A f =2 +3 = 2 6A = 2 6 216 = 72m 3 2 3
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

27 / 31

Try this one

Example An advertisement consists of a rectangular printed region plus 1 in margins on the sides and 1.5 in margins on the top and bottom. If the total area of the advertisement is to be 120 in2 , what dimensions should the advertisement be to maximize the area of the printed region?

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

28 / 31

Try this one

Example An advertisement consists of a rectangular printed region plus 1 in margins on the sides and 1.5 in margins on the top and bottom. If the total area of the advertisement is to be 120 in2 , what dimensions should the advertisement be to maximize the area of the printed region? Answer The optimal paper dimensions are 4 5 in by 6 5 in.

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

28 / 31

Solution
Let the dimensions of the printed region be x and y, P the printed area, and A the paper area. We wish to maximize P = xy subject to the constraint that 1 cm . A = (x + 2)(y + 3) 120 Isolating y in A 120 gives 120 y= 3 which yields x+2 ( ) 120 120x P=x 3 = 3x x+2 x+2 The domain of P is (0, )
. .

1.5 cm . . Lorem
ipsum dolor sit amet, consectetur adipiscing elit. Nam dapibus vehicula mollis. Proin nec tristique mi. Pellentesque quis placerat dolor. Praesent a nisl diam. Phasellus ut elit eu ligula accumsan euismod. Nunc condimentum lacinia risus a sodales. Morbi nunc risus, tincidunt in tristique sit amet, ultrices eu eros. Proin pellentesque aliquam nibh ut lobortis. Ut et sollicitudin ipsum. Proin gravida ligula eget odio molestie rhoncus sed nec massa. In ante lorem, imperdiet eget tincidunt at, pharetra sit amet felis. Nunc nisi velit, tempus ac suscipit quis, blandit vitae mauris. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia Curae;

y .

1.5 cm . x .
. . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

1 cm .
29 / 31

Solution (Concluded)
We want to find the absolute maximum value of P. Taking derivatives, dP (x + 2)(120) (120x)(1) 240 3(x + 2)2 = 3 = dx (x + 2)2 (x + 2)2 There is a single critical point when (x + 2)2 = 80 = x = 4 5 2 (the negative critical point doesnt count). The second derivative is d2 P 480 = 2 dx (x + 2)3 which is negative all ( )along the domain of P. Hence the unique critical point x = 4 5 2 cm is the absolute maximum of P. This means 120 the paper width is 4 5 cm, and the paper length is = 6 5 cm. 4 5
. . . . . .

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

30 / 31

Summary
Name [_

Problem Solving Strategy Draw a Picture


Kathy had a box of 8 crayons. She gave some crayons away. She has 5 left. How many crayons did Kathy give away?

Remember the checklist Ask yourself: what is the objective? Remember your geometry:
similar triangles right triangles trigonometric functions

UNDERSTAND

What do you want to find out? Draw a line under the question.

You can draw a picture to solve the problem.

crayons
CHECK

What number do I add to 5 to get 8? 8 = 5 5 + 3 = 8

Does your answer make sense? Explain. Draw a picture to solve the problem. Write how many were given away. I. I had 10 pencils. I gave some away. I have 3 left. How many pencils did I give away? ~7
What number do I add to 3 to make 10?
ft
ft I '' I I

ft

13 ill

:i i? 11

I I

H 11 M i l

U U U U> U U

V63.0121.002.2010Su, Calculus I (NYU)

Section 4.5 Optimization Problems

June 14, 2010

31 / 31

Vous aimerez peut-être aussi