SlideShare a Scribd company logo
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.1–4.4
   Guest speaker on Thursday: Arjun Krishnan

                                                  .   .   .   .   .   .
Announcements




           The midterm is graded!
           Quiz 4 Thursday on
           4.1–4.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
                                        p − 2w      1             1
                     A = ℓw =                  · 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
                                        p − 2w      1             1
                     A = ℓw =                  · 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
                                        p − 2w      1             1
                     A = ℓw =                  · 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

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




                                                                            .      .    .     .      .      .

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

                                                                                1
 We use the Closed Interval Method for A(w) =                                     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

                                                                                1
 We use the Closed Interval Method for A(w) =                                     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

                                              1               p
                                        0=      p − 2w =⇒ w =
                                              2               4




                                                                            .      .    .     .      .      .

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

                                                                                1
 We use the Closed Interval Method for A(w) =                                     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

                                              1               p
                                        0=      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

                                                                                1
 We use the Closed Interval Method for A(w) =                                     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

                                              1               p
                                        0=      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




                                                                       György Pólya
                                                                   (Hungarian, 1887–1985)
                                                                            .   .   .     .      .      .

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.



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

                                  CHECK
                                        Does your answer make sense?
                                        Explain.
                                                                                What number
                                        Draw a picture to solve the problem.   do I add to 3
                                        Write how many were given away.         to make 10?

                                        I. I had 10 pencils.                             ft   ft                ft   A
                                           I gave some away.                         13 ill
                                                                                     i   :i
                                                                                                   I
                                                                                                   '•'        I I
                                           I have 3 left. How many                       i?        «
                                                                                         11        I

                                           pencils did I give away?                                I
                                                                                                         .   H 11
                                                                                                                         .   .      .      .     .
                                                                                                             M i l

V63.0121.002.2010Su, Calculus I (NYU)         ~7 Section 4.5 Optimization Problems
                                                                                U U           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 don’t 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 don’t 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?

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




                                                                            .   .   .      .       .    .

V63.0121.002.2010Su, Calculus I (NYU)   Section 4.5 Optimization Problems               June 14, 2010   15 / 31
Which to use when?

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

         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
                                (p)            p     p2   p2
                            Q           =p·      −2·    =    = 80, 000m2
                                   4           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
                                                        A
                                          f(w) = 2        + 3w.
                                                        w
 The domain is all positive numbers.

                                                                            .   .   .      .       .    .

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)
                                                                            2A
 We need to find the minimum value of f(w) =                                   + 3w on (0, ∞).
                                                                            w




                                                                            .   .   .      .       .    .

V63.0121.002.2010Su, Calculus I (NYU)   Section 4.5 Optimization Problems               June 14, 2010   27 / 31
Solution (Continued)
                                                                            2A
 We need to find the minimum value of f(w) =                                   + 3w on (0, ∞).
                                                                            w
         We have
                                 df    2A
                                     =− 2 +3
                                 dw    w
                                √
                                  2A
         which is zero when w =      .
                                   3




                                                                            .   .   .      .       .    .

V63.0121.002.2010Su, Calculus I (NYU)   Section 4.5 Optimization Problems               June 14, 2010   27 / 31
Solution (Continued)
                                                                            2A
 We need to find the minimum value of f(w) =                                   + 3w on (0, ∞).
                                                                            w
         We have
                                    df        2A
                                         =− 2 +3
                                    dw        w
                                   √
                                      2A
         which is zero when w =           .
                                       3
         Since f′′ (w) = 4Aw−3 , 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)
                                                                            2A
 We need to find the minimum value of f(w) =                                   + 3w on (0, ∞).
                                                                            w
         We have
                                     df        2A
                                         =− 2 +3
                                     dw        w
                                    √
                                      2A
         which is zero when w =           .
                                       3
         Since f′′ (w) = 4Aw−3 , 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
               A      3A
         ℓ= =              = 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                                                          1
                                                                                        . .5 cm
  the printed area, and A the                                               .
                                                                            Lorem      ipsum dolor sit amet,
                                                                            consectetur adipiscing elit. Nam
  paper area. We wish to                                                    dapibus vehicula mollis. Proin nec
                                                                            tristique mi.      Pellentesque quis
  maximize P = xy subject to                                                placerat dolor. Praesent a nisl diam.
  the constraint that                                                       Phasellus ut elit eu ligula accumsan
                                                                            euismod.        Nunc condimentum
                                                                            lacinia risus a sodales. Morbi nunc
                                                                            risus, tincidunt in tristique sit amet,
    A = (x + 2)(y + 3) ≡ 120




                                                                 . cm




                                                                                                                      . cm
                                                          y
                                                          .                 ultrices eu eros. Proin pellentesque
                                                                            aliquam nibh ut lobortis.         Ut et




                                                                 1




                                                                                                                      1
                                                                            sollicitudin ipsum.      Proin gravida
  Isolating y in A ≡ 120 gives                                              ligula eget odio molestie rhoncus
                                                                            sed nec massa. In ante lorem,
       120                                                                  imperdiet eget tincidunt at, pharetra
  y=         − 3 which yields                                               sit amet felis.      Nunc nisi velit,
       x+2                                                                  tempus ac suscipit quis, blandit
                                                                            vitae mauris. Vestibulum ante ipsum
         (          )                                                       primis in faucibus orci luctus et
           120           120x                                           .   ultrices posuere cubilia Curae;
  P=x            −3 =          −3x
           x+2           x+2                                                            1
                                                                                        . .5 cm
  The domain of P is (0, ∞)                                                                   x
                                                                                              .
                                                                                 .        .       .        .          .      .

V63.0121.002.2010Su, Calculus I (NYU)   Section 4.5 Optimization Problems                             June 14, 2010          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 doesn’t 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                                  UNDERSTAND

                                                                        What do you want to find out?
                                                                                                           •


                                                                        Draw a line under the question.
          Ask yourself: what is the
          objective?                                                    You can draw a picture
                                                                        to solve the problem.

          Remember your geometry:
                                                                                                                         What number do I
                                                                                                                         add to 5 to get 8?
                                                                                                                            8 -     = 5
                 similar triangles                                                                         crayons         5 + 3 = 8


                 right triangles                                  CHECK
                                                                        Does your answer make sense?
                 trigonometric functions                                Explain.
                                                                                                                  What number
                                                                        Draw a picture to solve the problem.     do I add to 3
                                                                        Write how many were given away.           to make 10?

                                                                        I. I had 10 pencils.                                  ft   ft                ft   A
                                                                           I gave some away.                              13 ill
                                                                                                                          i   :i
                                                                                                                                        I
                                                                                                                                        '•'        I I
                                                                           I have 3 left. How many                            i?        «
                                                                                                                              11        I

                                                                           pencils did I give away?                                     I
                                                                                                                                                  H 11
                                                                                                                                                  M i l
                                                                              ~7                                          U U U U> U U




                                                                                   .        .          .             .                        .               .

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

More Related Content

What's hot

Introductory maths analysis chapter 05 official
Introductory maths analysis   chapter 05 officialIntroductory maths analysis   chapter 05 official
Introductory maths analysis chapter 05 official
Evert Sandye Taasiringan
 
Introductory maths analysis chapter 12 official
Introductory maths analysis   chapter 12 officialIntroductory maths analysis   chapter 12 official
Introductory maths analysis chapter 12 official
Evert Sandye Taasiringan
 
Bayesian estimate for shape parameter from generalized power function distrib...
Bayesian estimate for shape parameter from generalized power function distrib...Bayesian estimate for shape parameter from generalized power function distrib...
Bayesian estimate for shape parameter from generalized power function distrib...
Alexander Decker
 
Introductory maths analysis chapter 09 official
Introductory maths analysis   chapter 09 officialIntroductory maths analysis   chapter 09 official
Introductory maths analysis chapter 09 officialEvert Sandye Taasiringan
 
Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)
Matthew Leingang
 
Akitoshi Takayasu
Akitoshi TakayasuAkitoshi Takayasu
Akitoshi Takayasu
Suurist
 
Lesson 12: Linear Approximation
Lesson 12: Linear ApproximationLesson 12: Linear Approximation
Lesson 12: Linear ApproximationMatthew Leingang
 
Lesson 21: Antiderivatives (notes)
Lesson 21: Antiderivatives (notes)Lesson 21: Antiderivatives (notes)
Lesson 21: Antiderivatives (notes)
Matthew Leingang
 
Introductory maths analysis chapter 07 official
Introductory maths analysis   chapter 07 officialIntroductory maths analysis   chapter 07 official
Introductory maths analysis chapter 07 official
Evert Sandye Taasiringan
 
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
Kai-Wen Zhao
 
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
Matthew Leingang
 
Introductory maths analysis chapter 04 official
Introductory maths analysis   chapter 04 officialIntroductory maths analysis   chapter 04 official
Introductory maths analysis chapter 04 official
Evert Sandye Taasiringan
 
Introductory maths analysis chapter 01 official
Introductory maths analysis   chapter 01 officialIntroductory maths analysis   chapter 01 official
Introductory maths analysis chapter 01 official
Evert Sandye Taasiringan
 
Introductory maths analysis chapter 16 official
Introductory maths analysis   chapter 16 officialIntroductory maths analysis   chapter 16 official
Introductory maths analysis chapter 16 official
Evert Sandye Taasiringan
 
Ck31369376
Ck31369376Ck31369376
Ck31369376IJMER
 
Introductory maths analysis chapter 15 official
Introductory maths analysis   chapter 15 officialIntroductory maths analysis   chapter 15 official
Introductory maths analysis chapter 15 official
Evert Sandye Taasiringan
 
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
The Statistical and Applied Mathematical Sciences Institute
 
Introductory maths analysis chapter 11 official
Introductory maths analysis   chapter 11 officialIntroductory maths analysis   chapter 11 official
Introductory maths analysis chapter 11 official
Evert Sandye Taasiringan
 
Introductory maths analysis chapter 08 official
Introductory maths analysis   chapter 08 officialIntroductory maths analysis   chapter 08 official
Introductory maths analysis chapter 08 official
Evert Sandye Taasiringan
 

What's hot (19)

Introductory maths analysis chapter 05 official
Introductory maths analysis   chapter 05 officialIntroductory maths analysis   chapter 05 official
Introductory maths analysis chapter 05 official
 
Introductory maths analysis chapter 12 official
Introductory maths analysis   chapter 12 officialIntroductory maths analysis   chapter 12 official
Introductory maths analysis chapter 12 official
 
Bayesian estimate for shape parameter from generalized power function distrib...
Bayesian estimate for shape parameter from generalized power function distrib...Bayesian estimate for shape parameter from generalized power function distrib...
Bayesian estimate for shape parameter from generalized power function distrib...
 
Introductory maths analysis chapter 09 official
Introductory maths analysis   chapter 09 officialIntroductory maths analysis   chapter 09 official
Introductory maths analysis chapter 09 official
 
Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)Lesson 26: The Fundamental Theorem of Calculus (handout)
Lesson 26: The Fundamental Theorem of Calculus (handout)
 
Akitoshi Takayasu
Akitoshi TakayasuAkitoshi Takayasu
Akitoshi Takayasu
 
Lesson 12: Linear Approximation
Lesson 12: Linear ApproximationLesson 12: Linear Approximation
Lesson 12: Linear Approximation
 
Lesson 21: Antiderivatives (notes)
Lesson 21: Antiderivatives (notes)Lesson 21: Antiderivatives (notes)
Lesson 21: Antiderivatives (notes)
 
Introductory maths analysis chapter 07 official
Introductory maths analysis   chapter 07 officialIntroductory maths analysis   chapter 07 official
Introductory maths analysis chapter 07 official
 
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
NIPS paper review 2014: A Differential Equation for Modeling Nesterov’s Accel...
 
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
Lesson 26: The Fundamental Theorem of Calculus (Section 041 slides)
 
Introductory maths analysis chapter 04 official
Introductory maths analysis   chapter 04 officialIntroductory maths analysis   chapter 04 official
Introductory maths analysis chapter 04 official
 
Introductory maths analysis chapter 01 official
Introductory maths analysis   chapter 01 officialIntroductory maths analysis   chapter 01 official
Introductory maths analysis chapter 01 official
 
Introductory maths analysis chapter 16 official
Introductory maths analysis   chapter 16 officialIntroductory maths analysis   chapter 16 official
Introductory maths analysis chapter 16 official
 
Ck31369376
Ck31369376Ck31369376
Ck31369376
 
Introductory maths analysis chapter 15 official
Introductory maths analysis   chapter 15 officialIntroductory maths analysis   chapter 15 official
Introductory maths analysis chapter 15 official
 
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
QMC: Operator Splitting Workshop, Compactness Estimates for Nonlinear PDEs - ...
 
Introductory maths analysis chapter 11 official
Introductory maths analysis   chapter 11 officialIntroductory maths analysis   chapter 11 official
Introductory maths analysis chapter 11 official
 
Introductory maths analysis chapter 08 official
Introductory maths analysis   chapter 08 officialIntroductory maths analysis   chapter 08 official
Introductory maths analysis chapter 08 official
 

Viewers also liked

Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
Mel Anthony Pepito
 
Lesson 4: Calculating Limits (Section 41 slides)
Lesson 4: Calculating Limits (Section 41 slides)Lesson 4: Calculating Limits (Section 41 slides)
Lesson 4: Calculating Limits (Section 41 slides)
Mel Anthony Pepito
 
Lesson 3: Limits (Section 21 slides)
Lesson 3: Limits (Section 21 slides)Lesson 3: Limits (Section 21 slides)
Lesson 3: Limits (Section 21 slides)Mel Anthony Pepito
 
Lesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential FunctionsLesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential Functions
Mel Anthony Pepito
 
Lesson 22: Optimization II (Section 021 slides)
Lesson 22: Optimization II (Section 021 slides)Lesson 22: Optimization II (Section 021 slides)
Lesson 22: Optimization II (Section 021 slides)
Mel Anthony Pepito
 
Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides) Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides) Mel Anthony Pepito
 
Lesson 28: Integration by Subsitution
Lesson 28: Integration by SubsitutionLesson 28: Integration by Subsitution
Lesson 28: Integration by SubsitutionMel Anthony Pepito
 
Lesson 6: Limits Involving ∞ (Section 41 slides)
Lesson 6: Limits Involving ∞ (Section 41 slides)Lesson 6: Limits Involving ∞ (Section 41 slides)
Lesson 6: Limits Involving ∞ (Section 41 slides)Mel Anthony Pepito
 
Lesson 9: The Product and Quotient Rules (Section 21 slides)
Lesson 9: The Product and Quotient Rules (Section 21 slides)Lesson 9: The Product and Quotient Rules (Section 21 slides)
Lesson 9: The Product and Quotient Rules (Section 21 slides)
Mel Anthony Pepito
 
Lesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential FunctionsLesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential Functions
Mel Anthony Pepito
 
Lesson 5: Continuity (Section 21 slides)
Lesson 5: Continuity (Section 21 slides)Lesson 5: Continuity (Section 21 slides)
Lesson 5: Continuity (Section 21 slides)Mel Anthony Pepito
 
Lesson 10: The Chain Rule (Section 41 slides)
Lesson 10: The Chain Rule (Section 41 slides)Lesson 10: The Chain Rule (Section 41 slides)
Lesson 10: The Chain Rule (Section 41 slides)
Mel Anthony Pepito
 
Lesson 6: Limits Involving ∞ (Section 21 slides)
Lesson 6: Limits Involving ∞ (Section 21 slides)Lesson 6: Limits Involving ∞ (Section 21 slides)
Lesson 6: Limits Involving ∞ (Section 21 slides)Mel Anthony Pepito
 
Lesson 7: The Derivative (Section 21 slide)
Lesson 7: The Derivative (Section 21 slide)Lesson 7: The Derivative (Section 21 slide)
Lesson 7: The Derivative (Section 21 slide)
Mel Anthony Pepito
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
Mel Anthony Pepito
 
Lesson 12: Linear Approximation
Lesson 12: Linear ApproximationLesson 12: Linear Approximation
Lesson 12: Linear ApproximationMel Anthony Pepito
 
Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)
Mel Anthony Pepito
 
cvpr2011: game theory in CVPR part 1
cvpr2011: game theory in CVPR part 1cvpr2011: game theory in CVPR part 1
cvpr2011: game theory in CVPR part 1zukun
 

Viewers also liked (20)

Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
Lesson 17: Indeterminate Forms and L'Hopital's Rule (Section 021 slides)
 
Lecture7
Lecture7Lecture7
Lecture7
 
Lesson 4: Calculating Limits (Section 41 slides)
Lesson 4: Calculating Limits (Section 41 slides)Lesson 4: Calculating Limits (Section 41 slides)
Lesson 4: Calculating Limits (Section 41 slides)
 
Lesson 3: Limits (Section 21 slides)
Lesson 3: Limits (Section 21 slides)Lesson 3: Limits (Section 21 slides)
Lesson 3: Limits (Section 21 slides)
 
Lesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential FunctionsLesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential Functions
 
Lesson 22: Optimization II (Section 021 slides)
Lesson 22: Optimization II (Section 021 slides)Lesson 22: Optimization II (Section 021 slides)
Lesson 22: Optimization II (Section 021 slides)
 
Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides) Lesson 8: Basic Differentiation Rules (Section 41 slides)
Lesson 8: Basic Differentiation Rules (Section 41 slides)
 
Lesson 21: Curve Sketching
Lesson 21: Curve SketchingLesson 21: Curve Sketching
Lesson 21: Curve Sketching
 
Lesson 28: Integration by Subsitution
Lesson 28: Integration by SubsitutionLesson 28: Integration by Subsitution
Lesson 28: Integration by Subsitution
 
Lesson 6: Limits Involving ∞ (Section 41 slides)
Lesson 6: Limits Involving ∞ (Section 41 slides)Lesson 6: Limits Involving ∞ (Section 41 slides)
Lesson 6: Limits Involving ∞ (Section 41 slides)
 
Lesson 9: The Product and Quotient Rules (Section 21 slides)
Lesson 9: The Product and Quotient Rules (Section 21 slides)Lesson 9: The Product and Quotient Rules (Section 21 slides)
Lesson 9: The Product and Quotient Rules (Section 21 slides)
 
Lesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential FunctionsLesson 2: A Catalog of Essential Functions
Lesson 2: A Catalog of Essential Functions
 
Lesson 5: Continuity (Section 21 slides)
Lesson 5: Continuity (Section 21 slides)Lesson 5: Continuity (Section 21 slides)
Lesson 5: Continuity (Section 21 slides)
 
Lesson 10: The Chain Rule (Section 41 slides)
Lesson 10: The Chain Rule (Section 41 slides)Lesson 10: The Chain Rule (Section 41 slides)
Lesson 10: The Chain Rule (Section 41 slides)
 
Lesson 6: Limits Involving ∞ (Section 21 slides)
Lesson 6: Limits Involving ∞ (Section 21 slides)Lesson 6: Limits Involving ∞ (Section 21 slides)
Lesson 6: Limits Involving ∞ (Section 21 slides)
 
Lesson 7: The Derivative (Section 21 slide)
Lesson 7: The Derivative (Section 21 slide)Lesson 7: The Derivative (Section 21 slide)
Lesson 7: The Derivative (Section 21 slide)
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 021 ...
 
Lesson 12: Linear Approximation
Lesson 12: Linear ApproximationLesson 12: Linear Approximation
Lesson 12: Linear Approximation
 
Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)
 
cvpr2011: game theory in CVPR part 1
cvpr2011: game theory in CVPR part 1cvpr2011: game theory in CVPR part 1
cvpr2011: game theory in CVPR part 1
 

Similar to Lesson22 -optimization_problems_slides

Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)
Mel Anthony Pepito
 
Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Matthew Leingang
 
Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)
Matthew Leingang
 
Lesson 20: Optimization (handout)
Lesson 20: Optimization (handout)Lesson 20: Optimization (handout)
Lesson 20: Optimization (handout)
Matthew Leingang
 
Lesson 23: The Definite Integral (handout)
Lesson 23: The Definite Integral (handout)Lesson 23: The Definite Integral (handout)
Lesson 23: The Definite Integral (handout)Matthew Leingang
 
Lesson 19: The Mean Value Theorem (Section 041 handout)
Lesson 19: The Mean Value Theorem (Section 041 handout)Lesson 19: The Mean Value Theorem (Section 041 handout)
Lesson 19: The Mean Value Theorem (Section 041 handout)
Matthew Leingang
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Matthew Leingang
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
Matthew Leingang
 
Lesson 19: The Mean Value Theorem (Section 021 handout)
Lesson 19: The Mean Value Theorem (Section 021 handout)Lesson 19: The Mean Value Theorem (Section 021 handout)
Lesson 19: The Mean Value Theorem (Section 021 handout)
Matthew Leingang
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
Matthew Leingang
 
Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)Matthew Leingang
 
Lesson 25: The Fundamental Theorem of Calculus (handout)
Lesson 25: The Fundamental Theorem of Calculus (handout)Lesson 25: The Fundamental Theorem of Calculus (handout)
Lesson 25: The Fundamental Theorem of Calculus (handout)Matthew Leingang
 
Lesson 24: Areas, Distances, the Integral (Section 041 handout)
Lesson 24: Areas, Distances, the Integral (Section 041 handout)Lesson 24: Areas, Distances, the Integral (Section 041 handout)
Lesson 24: Areas, Distances, the Integral (Section 041 handout)
Matthew Leingang
 
Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)
Matthew Leingang
 
Lesson 21: Curve Sketching
Lesson 21: Curve SketchingLesson 21: Curve Sketching
Lesson 21: Curve SketchingMatthew Leingang
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)
Matthew Leingang
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Mel Anthony Pepito
 
Lesson 23: Antiderivatives
Lesson 23: AntiderivativesLesson 23: Antiderivatives
Lesson 23: AntiderivativesMatthew Leingang
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Matthew Leingang
 

Similar to Lesson22 -optimization_problems_slides (20)

Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)
 
Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)
 
Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)
 
Lesson 20: Optimization (handout)
Lesson 20: Optimization (handout)Lesson 20: Optimization (handout)
Lesson 20: Optimization (handout)
 
Lesson 23: The Definite Integral (handout)
Lesson 23: The Definite Integral (handout)Lesson 23: The Definite Integral (handout)
Lesson 23: The Definite Integral (handout)
 
Lesson 19: The Mean Value Theorem (Section 041 handout)
Lesson 19: The Mean Value Theorem (Section 041 handout)Lesson 19: The Mean Value Theorem (Section 041 handout)
Lesson 19: The Mean Value Theorem (Section 041 handout)
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
 
Lesson 19: The Mean Value Theorem (Section 021 handout)
Lesson 19: The Mean Value Theorem (Section 021 handout)Lesson 19: The Mean Value Theorem (Section 021 handout)
Lesson 19: The Mean Value Theorem (Section 021 handout)
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
 
Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)
 
Lesson 25: The Fundamental Theorem of Calculus (handout)
Lesson 25: The Fundamental Theorem of Calculus (handout)Lesson 25: The Fundamental Theorem of Calculus (handout)
Lesson 25: The Fundamental Theorem of Calculus (handout)
 
Lesson 24: Areas, Distances, the Integral (Section 041 handout)
Lesson 24: Areas, Distances, the Integral (Section 041 handout)Lesson 24: Areas, Distances, the Integral (Section 041 handout)
Lesson 24: Areas, Distances, the Integral (Section 041 handout)
 
Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)
 
Lesson 21: Curve Sketching
Lesson 21: Curve SketchingLesson 21: Curve Sketching
Lesson 21: Curve Sketching
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
Lesson 20: Derivatives and the Shape of Curves (Section 041 slides)
 
Lesson 23: Antiderivatives
Lesson 23: AntiderivativesLesson 23: Antiderivatives
Lesson 23: Antiderivatives
 
Lesson 23: Antiderivatives
Lesson 23: AntiderivativesLesson 23: Antiderivatives
Lesson 23: Antiderivatives
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
 

More from Mel Anthony Pepito

Lesson 16: Inverse Trigonometric Functions
Lesson 16: Inverse Trigonometric FunctionsLesson 16: Inverse Trigonometric Functions
Lesson 16: Inverse Trigonometric FunctionsMel Anthony Pepito
 
Lesson 11: Implicit Differentiation
Lesson 11: Implicit DifferentiationLesson 11: Implicit Differentiation
Lesson 11: Implicit Differentiation
Mel Anthony Pepito
 
Lesson 13: Related Rates Problems
Lesson 13: Related Rates ProblemsLesson 13: Related Rates Problems
Lesson 13: Related Rates ProblemsMel Anthony Pepito
 
Lesson 14: Derivatives of Logarithmic and Exponential Functions
Lesson 14: Derivatives of Logarithmic and Exponential FunctionsLesson 14: Derivatives of Logarithmic and Exponential Functions
Lesson 14: Derivatives of Logarithmic and Exponential FunctionsMel Anthony Pepito
 
Lesson 15: Exponential Growth and Decay
Lesson 15: Exponential Growth and DecayLesson 15: Exponential Growth and Decay
Lesson 15: Exponential Growth and DecayMel Anthony Pepito
 
Lesson 17: Indeterminate Forms and L'Hôpital's Rule
Lesson 17: Indeterminate Forms and L'Hôpital's RuleLesson 17: Indeterminate Forms and L'Hôpital's Rule
Lesson 17: Indeterminate Forms and L'Hôpital's RuleMel Anthony Pepito
 
Lesson18 -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slidesLesson18 -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slidesMel Anthony Pepito
 
Lesson 19: The Mean Value Theorem
Lesson 19: The Mean Value TheoremLesson 19: The Mean Value Theorem
Lesson 19: The Mean Value TheoremMel Anthony Pepito
 
Lesson 25: The Definite Integral
Lesson 25: The Definite IntegralLesson 25: The Definite Integral
Lesson 25: The Definite IntegralMel Anthony Pepito
 
Lesson 26: Evaluating Definite Integrals
Lesson 26: Evaluating Definite IntegralsLesson 26: Evaluating Definite Integrals
Lesson 26: Evaluating Definite IntegralsMel Anthony Pepito
 
Lesson 27: The Fundamental Theorem of Calculus
Lesson 27: The Fundamental Theorem of Calculus Lesson 27: The Fundamental Theorem of Calculus
Lesson 27: The Fundamental Theorem of Calculus Mel Anthony Pepito
 
Introduction
IntroductionIntroduction
Introduction
Mel Anthony Pepito
 
Introduction
IntroductionIntroduction
Introduction
Mel Anthony Pepito
 
Lesson 1: Functions
Lesson 1: FunctionsLesson 1: Functions
Lesson 1: Functions
Mel Anthony Pepito
 
Lesson 5: Continuity (Section 41 slides)
Lesson 5: Continuity (Section 41 slides)Lesson 5: Continuity (Section 41 slides)
Lesson 5: Continuity (Section 41 slides)Mel Anthony Pepito
 
Lesson 4: Calculating Limits (Section 21 slides)
Lesson 4: Calculating Limits (Section 21 slides)Lesson 4: Calculating Limits (Section 21 slides)
Lesson 4: Calculating Limits (Section 21 slides)
Mel Anthony Pepito
 
Lesson 7: The Derivative (Section 41 slides)
Lesson 7: The Derivative (Section 41 slides)Lesson 7: The Derivative (Section 41 slides)
Lesson 7: The Derivative (Section 41 slides)
Mel Anthony Pepito
 

More from Mel Anthony Pepito (19)

Lesson 16: Inverse Trigonometric Functions
Lesson 16: Inverse Trigonometric FunctionsLesson 16: Inverse Trigonometric Functions
Lesson 16: Inverse Trigonometric Functions
 
Lesson 11: Implicit Differentiation
Lesson 11: Implicit DifferentiationLesson 11: Implicit Differentiation
Lesson 11: Implicit Differentiation
 
Lesson 13: Related Rates Problems
Lesson 13: Related Rates ProblemsLesson 13: Related Rates Problems
Lesson 13: Related Rates Problems
 
Lesson 14: Derivatives of Logarithmic and Exponential Functions
Lesson 14: Derivatives of Logarithmic and Exponential FunctionsLesson 14: Derivatives of Logarithmic and Exponential Functions
Lesson 14: Derivatives of Logarithmic and Exponential Functions
 
Lesson 15: Exponential Growth and Decay
Lesson 15: Exponential Growth and DecayLesson 15: Exponential Growth and Decay
Lesson 15: Exponential Growth and Decay
 
Lesson 17: Indeterminate Forms and L'Hôpital's Rule
Lesson 17: Indeterminate Forms and L'Hôpital's RuleLesson 17: Indeterminate Forms and L'Hôpital's Rule
Lesson 17: Indeterminate Forms and L'Hôpital's Rule
 
Lesson18 -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slidesLesson18 -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slides
 
Lesson 19: The Mean Value Theorem
Lesson 19: The Mean Value TheoremLesson 19: The Mean Value Theorem
Lesson 19: The Mean Value Theorem
 
Lesson 25: The Definite Integral
Lesson 25: The Definite IntegralLesson 25: The Definite Integral
Lesson 25: The Definite Integral
 
Lesson 24: Area and Distances
Lesson 24: Area and DistancesLesson 24: Area and Distances
Lesson 24: Area and Distances
 
Lesson 26: Evaluating Definite Integrals
Lesson 26: Evaluating Definite IntegralsLesson 26: Evaluating Definite Integrals
Lesson 26: Evaluating Definite Integrals
 
Lesson 27: The Fundamental Theorem of Calculus
Lesson 27: The Fundamental Theorem of Calculus Lesson 27: The Fundamental Theorem of Calculus
Lesson 27: The Fundamental Theorem of Calculus
 
Introduction
IntroductionIntroduction
Introduction
 
Introduction
IntroductionIntroduction
Introduction
 
Lesson 3: Limits
Lesson 3: LimitsLesson 3: Limits
Lesson 3: Limits
 
Lesson 1: Functions
Lesson 1: FunctionsLesson 1: Functions
Lesson 1: Functions
 
Lesson 5: Continuity (Section 41 slides)
Lesson 5: Continuity (Section 41 slides)Lesson 5: Continuity (Section 41 slides)
Lesson 5: Continuity (Section 41 slides)
 
Lesson 4: Calculating Limits (Section 21 slides)
Lesson 4: Calculating Limits (Section 21 slides)Lesson 4: Calculating Limits (Section 21 slides)
Lesson 4: Calculating Limits (Section 21 slides)
 
Lesson 7: The Derivative (Section 41 slides)
Lesson 7: The Derivative (Section 41 slides)Lesson 7: The Derivative (Section 41 slides)
Lesson 7: The Derivative (Section 41 slides)
 

Recently uploaded

State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Prayukth K V
 
UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3
DianaGray10
 
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Thierry Lestable
 
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
Product School
 
"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi
Fwdays
 
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdfSmart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
91mobiles
 
PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)
Ralf Eggert
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
BookNet Canada
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
Elena Simperl
 
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
Product School
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance
 
Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*
Frank van Harmelen
 
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptxIOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
Abida Shariff
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
UiPathCommunity
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Tobias Schneck
 
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Jeffrey Haguewood
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
Cheryl Hung
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
Product School
 
Accelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish CachingAccelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish Caching
Thijs Feryn
 

Recently uploaded (20)

State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
 
UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3UiPath Test Automation using UiPath Test Suite series, part 3
UiPath Test Automation using UiPath Test Suite series, part 3
 
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
 
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
AI for Every Business: Unlocking Your Product's Universal Potential by VP of ...
 
"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi
 
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdfSmart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
 
PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)PHP Frameworks: I want to break free (IPC Berlin 2024)
PHP Frameworks: I want to break free (IPC Berlin 2024)
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
 
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
 
Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*Neuro-symbolic is not enough, we need neuro-*semantic*
Neuro-symbolic is not enough, we need neuro-*semantic*
 
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptxIOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
IOS-PENTESTING-BEGINNERS-PRACTICAL-GUIDE-.pptx
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
 
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
 
Accelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish CachingAccelerate your Kubernetes clusters with Varnish Caching
Accelerate your Kubernetes clusters with Varnish Caching
 

Lesson22 -optimization_problems_slides

  • 1. 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.1–4.4 Guest speaker on Thursday: Arjun Krishnan . . . . . .
  • 2. Announcements The midterm is graded! Quiz 4 Thursday on 4.1–4.4 Guest speaker on Thursday: Arjun Krishnan . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 2 / 31
  • 3. 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
  • 4. 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
  • 5. 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
  • 6. 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
  • 7. 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
  • 8. 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
  • 9. 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
  • 10. 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
  • 11. 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
  • 12. 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 p − 2w 1 1 A = ℓw = · 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
  • 13. 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 p − 2w 1 1 A = ℓw = · 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
  • 14. 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 p − 2w 1 1 A = ℓw = · 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
  • 15. Solution Concluded 1 We use the Closed Interval Method for A(w) = pw − w2 on [0, p/2]. 2 At the endpoints, A(0) = A(p/2) = 0. . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 7 / 31
  • 16. Solution Concluded 1 We use the Closed Interval Method for A(w) = 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
  • 17. Solution Concluded 1 We use the Closed Interval Method for A(w) = 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 1 p 0= p − 2w =⇒ w = 2 4 . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 7 / 31
  • 18. Solution Concluded 1 We use the Closed Interval Method for A(w) = 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 1 p 0= 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
  • 19. Solution Concluded 1 We use the Closed Interval Method for A(w) = 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 1 p 0= 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
  • 20. 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
  • 21. Strategies for Problem Solving 1. Understand the problem 2. Devise a plan 3. Carry out the plan 4. Review and extend György Pólya (Hungarian, 1887–1985) . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 9 / 31
  • 22. 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
  • 23. 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
  • 24. 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
  • 25. 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
  • 26. 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
  • 27. 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
  • 28. 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. What number do I add to 5 to get 8? 8 - = 5 crayons 5 + 3 = 8 CHECK Does your answer make sense? Explain. What number Draw a picture to solve the problem. do I add to 3 Write how many were given away. to make 10? I. I had 10 pencils. ft ft ft A I gave some away. 13 ill i :i I '•' I I I have 3 left. How many i? « 11 I pencils did I give away? I . H 11 . . . . . M i l V63.0121.002.2010Su, Calculus I (NYU) ~7 Section 4.5 Optimization Problems U U U U> U U June 14, 2010 11 / 31
  • 29. 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
  • 30. 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
  • 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
  • 32. 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
  • 33. 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 don’t know yet). . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 14 / 31
  • 34. 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 don’t 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
  • 35. Which to use when? CIM 1DT 2DT Pro – no need for – works on – works on inequalities non-closed, non-closed, – gets global non-bounded non-bounded extrema intervals intervals automatically – only one derivative – no need for inequalities Con – only for closed – Uses inequalities – More derivatives bounded intervals – More work at – less conclusive boundary than CIM than 1DT – more work at boundary than CIM . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 15 / 31
  • 36. Which to use when? CIM 1DT 2DT Pro – no need for – works on – works on inequalities non-closed, non-closed, – gets global non-bounded non-bounded extrema intervals intervals automatically – only one derivative – no need for inequalities Con – only for closed – Uses inequalities – More derivatives bounded intervals – More work at – less conclusive boundary than CIM than 1DT – more work at boundary than CIM 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
  • 37. 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
  • 38. 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
  • 39. Solution 1. Everybody understand? . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 18 / 31
  • 40. 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
  • 41. 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
  • 42. 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
  • 43. Solution 1. Everybody understand? . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 20 / 31
  • 44. 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
  • 45. 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
  • 46. 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
  • 47. 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
  • 48. 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
  • 49. 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
  • 50. 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
  • 51. 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
  • 52. 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
  • 53. 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
  • 54. 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
  • 55. 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 (p) p p2 p2 Q =p· −2· = = 80, 000m2 4 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
  • 56. 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
  • 57. 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 A f(w) = 2 + 3w. w The domain is all positive numbers. . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 25 / 31
  • 58. 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
  • 59. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on (0, ∞). w . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 27 / 31
  • 60. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on (0, ∞). w We have df 2A =− 2 +3 dw w √ 2A which is zero when w = . 3 . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 27 / 31
  • 61. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on (0, ∞). w We have df 2A =− 2 +3 dw w √ 2A which is zero when w = . 3 Since f′′ (w) = 4Aw−3 , 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
  • 62. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on (0, ∞). w We have df 2A =− 2 +3 dw w √ 2A which is zero when w = . 3 Since f′′ (w) = 4Aw−3 , 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 A 3A ℓ= = = 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
  • 63. 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
  • 64. 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
  • 65. Solution Let the dimensions of the printed region be x and y, P 1 . .5 cm the printed area, and A the . Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nam paper area. We wish to dapibus vehicula mollis. Proin nec tristique mi. Pellentesque quis maximize P = xy subject to placerat dolor. Praesent a nisl diam. the constraint that Phasellus ut elit eu ligula accumsan euismod. Nunc condimentum lacinia risus a sodales. Morbi nunc risus, tincidunt in tristique sit amet, A = (x + 2)(y + 3) ≡ 120 . cm . cm y . ultrices eu eros. Proin pellentesque aliquam nibh ut lobortis. Ut et 1 1 sollicitudin ipsum. Proin gravida Isolating y in A ≡ 120 gives ligula eget odio molestie rhoncus sed nec massa. In ante lorem, 120 imperdiet eget tincidunt at, pharetra y= − 3 which yields sit amet felis. Nunc nisi velit, x+2 tempus ac suscipit quis, blandit vitae mauris. Vestibulum ante ipsum ( ) primis in faucibus orci luctus et 120 120x . ultrices posuere cubilia Curae; P=x −3 = −3x x+2 x+2 1 . .5 cm The domain of P is (0, ∞) x . . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 29 / 31
  • 66. 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 doesn’t 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
  • 67. 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 UNDERSTAND What do you want to find out? • Draw a line under the question. Ask yourself: what is the objective? You can draw a picture to solve the problem. Remember your geometry: What number do I add to 5 to get 8? 8 - = 5 similar triangles crayons 5 + 3 = 8 right triangles CHECK Does your answer make sense? trigonometric functions Explain. What number Draw a picture to solve the problem. do I add to 3 Write how many were given away. to make 10? I. I had 10 pencils. ft ft ft A I gave some away. 13 ill i :i I '•' I I I have 3 left. How many i? « 11 I pencils did I give away? I H 11 M i l ~7 U U U U> U U . . . . . . V63.0121.002.2010Su, Calculus I (NYU) Section 4.5 Optimization Problems June 14, 2010 31 / 31