SlideShare a Scribd company logo
1 of 60
Download to read offline
Section	4.5
                         Optimization	Problems

                                V63.0121, Calculus	I



                                    April	7, 2009


        Announcements
                Quiz	5	is	next	week, covering	Sections	4.1–4.4
                I am	moving	to	WWH 624	sometime	next	week	(April	13th)
                Happy	Opening	Day!

.       .
Image	credit: wallyg
                                                       .   .     .   .   .   .
Office	Hours	and	other	help



      Day       Time     Who/What       Where	in	WWH
       M     1:00–2:00   Leingang	OH       718/624
             5:00–7:00   Curto	PS             517
       T     1:00–2:00   Leingang	OH       718/624
             4:00–5:50   Curto	PS             317
       W     2:00–3:00   Leingang	OH       718/624
       R   9:00–10:00am Leingang	OH        718/624
       F     2:00–4:00   Curto	OH            1310
    I am	moving	to	WWH 624	sometime	next	week	(April	13th)




                                         .   .   .   .   .   .
Outline




  Leading	by	Example



  The	Text	in	the	Box



  More	Examples




                        .   .   .   .   .   .
Leading	by	Example


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




                                           .    .   .   .      .   .
Leading	by	Example


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

  Solution
      Draw	a	rectangle.


                                 .

                          .




                                           .    .   .   .      .   .
Leading	by	Example


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

  Solution
      Draw	a	rectangle.


                                 .

                          .
                                 .
                                 ℓ




                                           .    .   .   .      .   .
Leading	by	Example


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

  Solution
      Draw	a	rectangle.


                                 .        w
                                          .

                          .
                                 .
                                 ℓ




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




                                            .    .   .    .    .     .
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.




                                            .    .    .   .    .      .
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




                                            .    .    .   .    .      .
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
                          · w = (p − 2w)(w) = pw − w2
       A = ℓw =
                      2        2             2




                                            .    .    .   .    .      .
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
                          · w = (p − 2w)(w) = pw − w2
       A = ℓw =
                      2        2             2


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




                                            .    .    .   .    .      .
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
                          · w = (p − 2w)(w) = pw − w2
       A = ℓw =
                      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).


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




                                            .   .   .   .      .   .
Solution	(Concluded)
                                               1
                                                 pw − w2 on
We	use	the	Closed	Interval	Method	for A(w) =
                                               2
[0, p/2].
     At	the	endpoints, A(0) = A(p/2) = 0.
                                        dA  1
                                           = p − 2w.
     To	find	the	critical	points, we	find
                                        dw  2




                                         .     .   .   .      .   .
Solution	(Concluded)
                                               1
                                                 pw − w2 on
We	use	the	Closed	Interval	Method	for A(w) =
                                               2
[0, p/2].
     At	the	endpoints, A(0) = A(p/2) = 0.
                                        dA  1
                                           = p − 2w.
     To	find	the	critical	points, we	find
                                        dw  2
     The	critical	points	are	when

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




                                         .     .   .   .      .   .
Solution	(Concluded)
                                                  1
                                                    pw − w2 on
We	use	the	Closed	Interval	Method	for A(w) =
                                                  2
[0, p/2].
     At	the	endpoints, A(0) = A(p/2) = 0.
                                        dA  1
                                           = p − 2w.
     To	find	the	critical	points, we	find
                                        dw  2
     The	critical	points	are	when

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


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



                                              .   .    .    .    .    .
Solution	(Concluded)
                                                  1
                                                    pw − w2 on
We	use	the	Closed	Interval	Method	for A(w) =
                                                  2
[0, p/2].
     At	the	endpoints, A(0) = A(p/2) = 0.
                                        dA  1
                                           = p − 2w.
     To	find	the	critical	points, we	find
                                        dw  2
     The	critical	points	are	when

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


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


                                              .   .    .    .    .    .
Outline




  Leading	by	Example



  The	Text	in	the	Box



  More	Examples




                        .   .   .   .   .   .
The	Text	in	the	Box


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




                                          .   .   .     .   .   .
The	Text	in	the	Box


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




                                          .   .   .     .   .   .
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.




                                          .   .   .     .   .   .
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




                                              .    .    .   .     .   .
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.




                                               .   .    .   .     .   .
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.




                                               .   .    .   .     .   .
Recall: The	Closed	Interval	Method
See	Section	4.1




     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	or	most	negative	function	value
          are	the	global	minimum	points.




                                                     .    .    .    .    .      .
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′ (x) > 0 on (a, c) and f′ (x) < 0 on (c, b), then c is	a	local
          maximum.
          If f′ (x) < 0 on (a, c) and f′ (x) > 0 on (c, b), then c is	a	local
          minimum.
          If f′ (x) has	the	same	sign	on (a, c) and (c, b), then c is	not	a
          local	extremum.




                                                      .    .    .    .      .   .
See	Section	4.3




     Theorem	(The	Second	Derivative	Test)
     Let f, f′ , and f′′ be	continuous	on [a, b]. Let c be	be	a	point	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.

     If f′′ (c) = 0, the	second	derivative	test	is	inconclusive	(this	does
     not	mean c is	neither; we	just	don’t	know	yet).




                                                     .    .    .    .      .   .
Which	to	use	when?

          CIM                  1DT                  2DT
    Pro   no	 need	 for	 in-   w o r k s	     on    w o r k s	    on
          equalities           non-closed,          non-closed,
          gets	 global	 ex-    non-bounded          non-bounded
          trema	 automati-     intervals            intervals
          cally                only	 one	 deriva-   no	 need	 for	 in-
                               tive                 equalities
   Con    only	 for	 closed    Uses	inequalities    More	derivatives
          bounded	 inter-      More	 work	 at       less	 conclusive
          vals                 boundary	 than       than	1DT
                               CIM                  more	 work	 at
                                                    boundary	 than
                                                    CIM



                                                .    .    .    .   .     .
Which	to	use	when? The	bottom	line




      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.




                                             .   .    .   .    .    .
Outline




  Leading	by	Example



  The	Text	in	the	Box



  More	Examples




                        .   .   .   .   .   .
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	800	m	of	wire	at	your	disposal, what	is	the	largest
  area	you	can	enclose, and	what	are	its	dimensions?




                                             .   .   .    .   .     .
Solution
    1. Everybody	understand?




                               .   .   .   .   .   .
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	800	m	of	wire	at	your	disposal, what	is	the	largest
  area	you	can	enclose, and	what	are	its	dimensions?




                                             .   .   .    .   .     .
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	800	m	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




                                             .   .   .    .   .     .
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	800	m	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




                                             .   .   .    .   .     .
Solution
    1. Everybody	understand?




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




                               .   .   .   .   .   .
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?




                          .
                      .

                                 .
          .



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




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




                                             .   .    .   .   .      .
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?




                          .
                      .

                                 .
          .



                                             .   .   .    .   .     .
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
                   .

                           .
                       .

                                 .
          .



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




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




                                             .   .    .   .   .      .
Solution
    1. Everybody	understand?
    2. Draw	a	diagram.
    3. Introduce	notation: 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]




                                             .   .    .   .   .      .
Solution
    1. Everybody	understand?
    2. Draw	a	diagram.
    3. Introduce	notation: 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
           = p − 4w, which	is	zero	when w = .
    6.
       dw                                  4




                                             .   .    .   .   .      .
Solution
    1. Everybody	understand?
    2. Draw	a	diagram.
    3. Introduce	notation: 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
           = p − 4w, which	is	zero	when w = .
    6.
       dw                                  4




                                             .   .    .   .   .      .
Solution
    1. Everybody	understand?
    2. Draw	a	diagram.
    3. Introduce	notation: 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
           = p − 4w, which	is	zero	when w = .
    6.
       dw                                  4
       Q(0) = Q(p/2) = 0, but
                   (p)               p2   p2
                               p
                                             = 80, 000m2
                         =p·     −2·
               Q                        =
                    4          4     16   8
       so	the	critical	point	is	the	absolute	maximum.
                                              .    .    .   .   .    .
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?




                                                .   .    .    .   .      .
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.


                                                .   .    .    .   .      .
.          .




w
.



    .
              .
              ℓ

                  A = ℓw ≡ 216
f = 2ℓ + 3w




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




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




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




                                              .    .   .    .    .      .
Solution	(Continued)
                                                  2A
We	need	to	find	the	minimum	value	of f(w) =           + 3w on
                                                  w
(0, ∞).
    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            2A       2A
                                       = 2 6A = 2 6 · 216 = 72m
    f            = 2·       +3
            3             2        3
                                              .    .   .    .    .      .
Example
A Norman	window	has	the	outline	of	a	semicircle	on	top	of	a
rectangle. Suppose	there	is 8 + 2π feet	of	wood	trim	available.
Find	the	dimensions	of	the	rectangle	and	semicircle	that	will
maximize	the	area	of	the	window.




                                        .




                                            .   .    .   .    .   .
Example
A Norman	window	has	the	outline	of	a	semicircle	on	top	of	a
rectangle. Suppose	there	is 8 + 2π feet	of	wood	trim	available.
Find	the	dimensions	of	the	rectangle	and	semicircle	that	will
maximize	the	area	of	the	window.




                                        .

Answer
The	dimensions	are	4ft	by	2ft.
                                            .   .    .   .    .   .
Solution
Let h and w be	the	height	and	width	of	the	window. We	have

                                                π ( w )2
                          π
           L = 2h + w +     w        A = wh +
                          2                     22
If L is	fixed	to	be 8 + 2π, we	have
                          16 + 4π − 2w − πw
                    h=                      ,
                                  4
so
                                                     (         )
     w                                                   1π
                                 π
A = (16 + 4π − 2w − πw) + w2 = (π + 4)w −                          w2 .
                                                         +
     4                           8                       28
                    (       )
                          π
So A′ = (π + 4)w − 1 +        , which	is	zero	when
                          4
     π+4
w=         = 4 ft. The	dimensions	are	4ft	by	2ft.
     1+ π2

                                           .    .    .     .       .      .
Summary




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




                                            .   .   .   .   .   .

More Related Content

What's hot

Partial diferential good
Partial diferential goodPartial diferential good
Partial diferential goodgenntmbr
 
Meanshift Tracking Presentation
Meanshift Tracking PresentationMeanshift Tracking Presentation
Meanshift Tracking Presentationsandtouch
 
Unit 3 greedy method
Unit 3  greedy methodUnit 3  greedy method
Unit 3 greedy methodMaryJacob24
 
Eight Regression Algorithms
Eight Regression AlgorithmsEight Regression Algorithms
Eight Regression Algorithmsguestfee8698
 
Artificial neural network
Artificial neural networkArtificial neural network
Artificial neural networkIldar Nurgaliev
 
Lecture6
Lecture6Lecture6
Lecture6voracle
 
Periodic differential operators
Periodic differential operatorsPeriodic differential operators
Periodic differential operatorsSpringer
 
Moment Closure Based Parameter Inference of Stochastic Kinetic Models
Moment Closure Based Parameter Inference of Stochastic Kinetic ModelsMoment Closure Based Parameter Inference of Stochastic Kinetic Models
Moment Closure Based Parameter Inference of Stochastic Kinetic ModelsColin Gillespie
 
Moment closure inference for stochastic kinetic models
Moment closure inference for stochastic kinetic modelsMoment closure inference for stochastic kinetic models
Moment closure inference for stochastic kinetic modelsColin Gillespie
 
On recent improvements in the conic optimizer in MOSEK
On recent improvements in the conic optimizer in MOSEKOn recent improvements in the conic optimizer in MOSEK
On recent improvements in the conic optimizer in MOSEKedadk
 
Refactoring in AS3
Refactoring in AS3Refactoring in AS3
Refactoring in AS3Eddie Kao
 
Lesson 9: The Product and Quotient Rule
Lesson 9: The Product and Quotient RuleLesson 9: The Product and Quotient Rule
Lesson 9: The Product and Quotient RuleMatthew Leingang
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 

What's hot (18)

Partial diferential good
Partial diferential goodPartial diferential good
Partial diferential good
 
Meanshift Tracking Presentation
Meanshift Tracking PresentationMeanshift Tracking Presentation
Meanshift Tracking Presentation
 
Colloquium
ColloquiumColloquium
Colloquium
 
Unit 3 greedy method
Unit 3  greedy methodUnit 3  greedy method
Unit 3 greedy method
 
Eight Regression Algorithms
Eight Regression AlgorithmsEight Regression Algorithms
Eight Regression Algorithms
 
PIMRC 2012
PIMRC 2012PIMRC 2012
PIMRC 2012
 
Artificial neural network
Artificial neural networkArtificial neural network
Artificial neural network
 
Lecture6
Lecture6Lecture6
Lecture6
 
Periodic differential operators
Periodic differential operatorsPeriodic differential operators
Periodic differential operators
 
Moment Closure Based Parameter Inference of Stochastic Kinetic Models
Moment Closure Based Parameter Inference of Stochastic Kinetic ModelsMoment Closure Based Parameter Inference of Stochastic Kinetic Models
Moment Closure Based Parameter Inference of Stochastic Kinetic Models
 
Moment closure inference for stochastic kinetic models
Moment closure inference for stochastic kinetic modelsMoment closure inference for stochastic kinetic models
Moment closure inference for stochastic kinetic models
 
On recent improvements in the conic optimizer in MOSEK
On recent improvements in the conic optimizer in MOSEKOn recent improvements in the conic optimizer in MOSEK
On recent improvements in the conic optimizer in MOSEK
 
Amp chapter-04
Amp chapter-04Amp chapter-04
Amp chapter-04
 
735
735735
735
 
Refactoring in AS3
Refactoring in AS3Refactoring in AS3
Refactoring in AS3
 
Chapter 12
Chapter 12Chapter 12
Chapter 12
 
Lesson 9: The Product and Quotient Rule
Lesson 9: The Product and Quotient RuleLesson 9: The Product and Quotient Rule
Lesson 9: The Product and Quotient Rule
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 

Viewers also liked

Lesson 22: Optimization II (Section 4 version)
Lesson 22: Optimization II (Section 4 version)Lesson 22: Optimization II (Section 4 version)
Lesson 22: Optimization II (Section 4 version)Matthew Leingang
 
Vmb divshare nl
Vmb divshare nlVmb divshare nl
Vmb divshare nlvri
 
Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Matthew Leingang
 
Electronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsElectronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsMatthew Leingang
 
Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Matthew Leingang
 
Streamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceStreamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceMatthew Leingang
 

Viewers also liked (8)

Lesson 22: Optimization II (Section 4 version)
Lesson 22: Optimization II (Section 4 version)Lesson 22: Optimization II (Section 4 version)
Lesson 22: Optimization II (Section 4 version)
 
Introduction
IntroductionIntroduction
Introduction
 
Vmb divshare nl
Vmb divshare nlVmb divshare nl
Vmb divshare nl
 
Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)Lesson 24: Areas and Distances, The Definite Integral (slides)
Lesson 24: Areas and Distances, The Definite Integral (slides)
 
Electronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsElectronic Grading of Paper Assessments
Electronic Grading of Paper Assessments
 
Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)Lesson 27: Integration by Substitution (slides)
Lesson 27: Integration by Substitution (slides)
 
Streamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choiceStreamlining assessment, feedback, and archival with auto-multiple-choice
Streamlining assessment, feedback, and archival with auto-multiple-choice
 
Making Lesson Plans
Making Lesson PlansMaking Lesson Plans
Making Lesson Plans
 

Similar to Lesson 22: Optimization I (Section 4 version)

Lesson 19: Optimization Problems
Lesson 19: Optimization ProblemsLesson 19: Optimization Problems
Lesson 19: Optimization ProblemsMatthew Leingang
 
Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Mel Anthony Pepito
 
Lesson 20: (More) Optimization Problems
Lesson 20: (More) Optimization ProblemsLesson 20: (More) Optimization Problems
Lesson 20: (More) Optimization ProblemsMatthew Leingang
 
Lesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationLesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationMatthew Leingang
 
dot product of vectors
dot product of vectorsdot product of vectors
dot product of vectorsElias Dinsa
 
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
 
Arc lengthparametrization
Arc lengthparametrizationArc lengthparametrization
Arc lengthparametrizationDivya Anand
 
Prin digcommselectedsoln
Prin digcommselectedsolnPrin digcommselectedsoln
Prin digcommselectedsolnAhmed Alshomi
 
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
 
Probability and stochastic processes 3rd edition Quiz Solutions
Probability and stochastic processes 3rd edition Quiz SolutionsProbability and stochastic processes 3rd edition Quiz Solutions
Probability and stochastic processes 3rd edition Quiz SolutionsChristopher Whitworth
 
Predicting Real-valued Outputs: An introduction to regression
Predicting Real-valued Outputs: An introduction to regressionPredicting Real-valued Outputs: An introduction to regression
Predicting Real-valued Outputs: An introduction to regressionguestfee8698
 
IJCER (www.ijceronline.com) International Journal of computational Engineeri...
 IJCER (www.ijceronline.com) International Journal of computational Engineeri... IJCER (www.ijceronline.com) International Journal of computational Engineeri...
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
 
Lesson 22: Quadratic Forms
Lesson 22: Quadratic FormsLesson 22: Quadratic Forms
Lesson 22: Quadratic FormsMatthew Leingang
 
Lesson 21: Curve Sketching (Section 10 version)
Lesson 21: Curve Sketching (Section 10 version)Lesson 21: Curve Sketching (Section 10 version)
Lesson 21: Curve Sketching (Section 10 version)Matthew Leingang
 
Change of variables in double integrals
Change of variables in double integralsChange of variables in double integrals
Change of variables in double integralsTarun Gehlot
 

Similar to Lesson 22: Optimization I (Section 4 version) (20)

Lesson 19: Optimization Problems
Lesson 19: Optimization ProblemsLesson 19: Optimization Problems
Lesson 19: Optimization Problems
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
 
Lesson 24: Optimization
Lesson 24: OptimizationLesson 24: Optimization
Lesson 24: Optimization
 
Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (slides)
 
Lesson 20: (More) Optimization Problems
Lesson 20: (More) Optimization ProblemsLesson 20: (More) Optimization Problems
Lesson 20: (More) Optimization Problems
 
Lesson 16: Implicit Differentiation
Lesson 16: Implicit DifferentiationLesson 16: Implicit Differentiation
Lesson 16: Implicit Differentiation
 
dot product of vectors
dot product of vectorsdot product of vectors
dot product of vectors
 
Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)
 
Arc lengthparametrization
Arc lengthparametrizationArc lengthparametrization
Arc lengthparametrization
 
Prin digcommselectedsoln
Prin digcommselectedsolnPrin digcommselectedsoln
Prin digcommselectedsoln
 
B.Tech-II_Unit-IV
B.Tech-II_Unit-IVB.Tech-II_Unit-IV
B.Tech-II_Unit-IV
 
Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)
 
Probability and stochastic processes 3rd edition Quiz Solutions
Probability and stochastic processes 3rd edition Quiz SolutionsProbability and stochastic processes 3rd edition Quiz Solutions
Probability and stochastic processes 3rd edition Quiz Solutions
 
Predicting Real-valued Outputs: An introduction to regression
Predicting Real-valued Outputs: An introduction to regressionPredicting Real-valued Outputs: An introduction to regression
Predicting Real-valued Outputs: An introduction to regression
 
IJCER (www.ijceronline.com) International Journal of computational Engineeri...
 IJCER (www.ijceronline.com) International Journal of computational Engineeri... IJCER (www.ijceronline.com) International Journal of computational Engineeri...
IJCER (www.ijceronline.com) International Journal of computational Engineeri...
 
Lesson 22: Quadratic Forms
Lesson 22: Quadratic FormsLesson 22: Quadratic Forms
Lesson 22: Quadratic Forms
 
Feedback Vertex Set
Feedback Vertex SetFeedback Vertex Set
Feedback Vertex Set
 
Dipoleinshell
DipoleinshellDipoleinshell
Dipoleinshell
 
Lesson 21: Curve Sketching (Section 10 version)
Lesson 21: Curve Sketching (Section 10 version)Lesson 21: Curve Sketching (Section 10 version)
Lesson 21: Curve Sketching (Section 10 version)
 
Change of variables in double integrals
Change of variables in double integralsChange of variables in double integrals
Change of variables in double integrals
 

More from Matthew Leingang

Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Matthew Leingang
 
Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Matthew Leingang
 
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
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Matthew Leingang
 
Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Matthew Leingang
 
Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Matthew Leingang
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Matthew Leingang
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Matthew Leingang
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Matthew Leingang
 
Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Matthew Leingang
 
Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Matthew Leingang
 
Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Matthew Leingang
 
Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Matthew Leingang
 
Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Matthew Leingang
 
Lesson 18: Maximum and Minimum Values (slides)
Lesson 18: Maximum and Minimum Values (slides)Lesson 18: Maximum and Minimum Values (slides)
Lesson 18: Maximum and Minimum Values (slides)Matthew Leingang
 
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)Matthew Leingang
 
Lesson 18: Maximum and Minimum Values (handout)
Lesson 18: Maximum and Minimum Values (handout)Lesson 18: Maximum and Minimum Values (handout)
Lesson 18: Maximum and Minimum Values (handout)Matthew Leingang
 
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)Matthew Leingang
 
Lesson 16: Inverse Trigonometric Functions (slides)
Lesson 16: Inverse Trigonometric Functions (slides)Lesson 16: Inverse Trigonometric Functions (slides)
Lesson 16: Inverse Trigonometric Functions (slides)Matthew Leingang
 

More from Matthew Leingang (20)

Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)
 
Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)Lesson 26: The Fundamental Theorem of Calculus (slides)
Lesson 26: The Fundamental Theorem of Calculus (slides)
 
Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (handout)Lesson 27: Integration by Substitution (handout)
Lesson 27: Integration by Substitution (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)
Lesson 26: The Fundamental Theorem of Calculus (handout)
 
Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)Lesson 25: Evaluating Definite Integrals (slides)
Lesson 25: Evaluating Definite Integrals (slides)
 
Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)Lesson 25: Evaluating Definite Integrals (handout)
Lesson 25: Evaluating Definite Integrals (handout)
 
Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)Lesson 24: Areas and Distances, The Definite Integral (handout)
Lesson 24: Areas and Distances, The Definite Integral (handout)
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)
 
Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)Lesson 23: Antiderivatives (slides)
Lesson 23: Antiderivatives (slides)
 
Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)Lesson 22: Optimization Problems (handout)
Lesson 22: Optimization Problems (handout)
 
Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)Lesson 21: Curve Sketching (slides)
Lesson 21: Curve Sketching (slides)
 
Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)Lesson 21: Curve Sketching (handout)
Lesson 21: Curve Sketching (handout)
 
Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)Lesson 20: Derivatives and the Shapes of Curves (slides)
Lesson 20: Derivatives and the Shapes of Curves (slides)
 
Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)Lesson 20: Derivatives and the Shapes of Curves (handout)
Lesson 20: Derivatives and the Shapes of Curves (handout)
 
Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)Lesson 19: The Mean Value Theorem (slides)
Lesson 19: The Mean Value Theorem (slides)
 
Lesson 18: Maximum and Minimum Values (slides)
Lesson 18: Maximum and Minimum Values (slides)Lesson 18: Maximum and Minimum Values (slides)
Lesson 18: Maximum and Minimum Values (slides)
 
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (slides)
 
Lesson 18: Maximum and Minimum Values (handout)
Lesson 18: Maximum and Minimum Values (handout)Lesson 18: Maximum and Minimum Values (handout)
Lesson 18: Maximum and Minimum Values (handout)
 
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)
Lesson 17: Indeterminate forms and l'Hôpital's Rule (handout)
 
Lesson 16: Inverse Trigonometric Functions (slides)
Lesson 16: Inverse Trigonometric Functions (slides)Lesson 16: Inverse Trigonometric Functions (slides)
Lesson 16: Inverse Trigonometric Functions (slides)
 

Recently uploaded

AI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsAI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsMemoori
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking MenDelhi Call girls
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationSafe Software
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024Scott Keck-Warren
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):comworks
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...shyamraj55
 
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsSnow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsHyundai Motor Group
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhisoniya singh
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...HostedbyConfluent
 
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking MenDelhi Call girls
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Scott Keck-Warren
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesSinan KOZAK
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slidespraypatel2
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxOnBoard
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Alan Dix
 

Recently uploaded (20)

AI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsAI as an Interface for Commercial Buildings
AI as an Interface for Commercial Buildings
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
 
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024SQL Database Design For Developers at php[tek] 2024
SQL Database Design For Developers at php[tek] 2024
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping Elbows
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
 
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsSnow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
 
The transition to renewables in India.pdf
The transition to renewables in India.pdfThe transition to renewables in India.pdf
The transition to renewables in India.pdf
 
08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men08448380779 Call Girls In Civil Lines Women Seeking Men
08448380779 Call Girls In Civil Lines Women Seeking Men
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slides
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptx
 
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...Swan(sea) Song – personal research during my six years at Swansea ... and bey...
Swan(sea) Song – personal research during my six years at Swansea ... and bey...
 

Lesson 22: Optimization I (Section 4 version)

  • 1. Section 4.5 Optimization Problems V63.0121, Calculus I April 7, 2009 Announcements Quiz 5 is next week, covering Sections 4.1–4.4 I am moving to WWH 624 sometime next week (April 13th) Happy Opening Day! . . Image credit: wallyg . . . . . .
  • 2. Office Hours and other help Day Time Who/What Where in WWH M 1:00–2:00 Leingang OH 718/624 5:00–7:00 Curto PS 517 T 1:00–2:00 Leingang OH 718/624 4:00–5:50 Curto PS 317 W 2:00–3:00 Leingang OH 718/624 R 9:00–10:00am Leingang OH 718/624 F 2:00–4:00 Curto OH 1310 I am moving to WWH 624 sometime next week (April 13th) . . . . . .
  • 3. Outline Leading by Example The Text in the Box More Examples . . . . . .
  • 4. Leading by Example Example What is the rectangle of fixed perimeter with maximum area? . . . . . .
  • 5. Leading by Example Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle. . . . . . . . .
  • 6. Leading by Example Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle. . . . ℓ . . . . . .
  • 7. Leading by Example Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle. . w . . . ℓ . . . . . .
  • 8. Solution (Continued) Let its length be ℓ and its width be w. The objective function is area A = ℓw. . . . . . .
  • 9. 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. . . . . . .
  • 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. p − 2w Since p = 2ℓ + 2w, we have ℓ = , 2 . . . . . .
  • 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 ℓ = , so 2 p − 2w 1 1 · w = (p − 2w)(w) = pw − w2 A = ℓw = 2 2 2 . . . . . .
  • 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 · w = (p − 2w)(w) = pw − w2 A = ℓw = 2 2 2 Now we have A as a function of w alone (p is constant). . . . . . .
  • 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 · w = (p − 2w)(w) = pw − w2 A = ℓw = 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). . . . . . .
  • 14. Solution (Concluded) 1 pw − w2 on We use the Closed Interval Method for A(w) = 2 [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. . . . . . .
  • 15. Solution (Concluded) 1 pw − w2 on We use the Closed Interval Method for A(w) = 2 [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. dA 1 = p − 2w. To find the critical points, we find dw 2 . . . . . .
  • 16. Solution (Concluded) 1 pw − w2 on We use the Closed Interval Method for A(w) = 2 [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. dA 1 = p − 2w. To find the critical points, we find dw 2 The critical points are when p 1 p − 2w =⇒ w = 0= 2 4 . . . . . .
  • 17. Solution (Concluded) 1 pw − w2 on We use the Closed Interval Method for A(w) = 2 [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. dA 1 = p − 2w. To find the critical points, we find dw 2 The critical points are when p 1 p − 2w =⇒ w = 0= 2 4 Since this is the only critical point, it must be the maximum. p In this case ℓ = as well. 4 . . . . . .
  • 18. Solution (Concluded) 1 pw − w2 on We use the Closed Interval Method for A(w) = 2 [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. dA 1 = p − 2w. To find the critical points, we find dw 2 The critical points are when p 1 p − 2w =⇒ w = 0= 2 4 Since this is the only critical point, it must be the maximum. p In this case ℓ = as well. 4 We have a square! The maximal area is A(p/4) = p2 /16. . . . . . .
  • 19. Outline Leading by Example The Text in the Box More Examples . . . . . .
  • 20. The Text in the Box 1. Understand the Problem. What is known? What is unknown? What are the conditions? . . . . . .
  • 21. The Text in the Box 1. Understand the Problem. What is known? What is unknown? What are the conditions? 2. Draw a diagram. . . . . . .
  • 22. 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. . . . . . .
  • 23. 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 . . . . . .
  • 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. 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. . . . . . .
  • 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 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. . . . . . .
  • 26. Recall: The Closed Interval Method See Section 4.1 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 or most negative function value are the global minimum points. . . . . . .
  • 27. 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′ (x) > 0 on (a, c) and f′ (x) < 0 on (c, b), then c is a local maximum. If f′ (x) < 0 on (a, c) and f′ (x) > 0 on (c, b), then c is a local minimum. If f′ (x) has the same sign on (a, c) and (c, b), then c is not a local extremum. . . . . . .
  • 28. See Section 4.3 Theorem (The Second Derivative Test) Let f, f′ , and f′′ be continuous on [a, b]. Let c be be a point 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. If f′′ (c) = 0, the second derivative test is inconclusive (this does not mean c is neither; we just don’t know yet). . . . . . .
  • 29. Which to use when? CIM 1DT 2DT Pro no need for in- w o r k s on w o r k s on equalities non-closed, non-closed, gets global ex- non-bounded non-bounded trema automati- intervals intervals cally only one deriva- no need for in- tive equalities Con only for closed Uses inequalities More derivatives bounded inter- More work at less conclusive vals boundary than than 1DT CIM more work at boundary than CIM . . . . . .
  • 30. Which to use when? The bottom line 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. . . . . . .
  • 31. Outline Leading by Example The Text in the Box More Examples . . . . . .
  • 32. 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 800 m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions? . . . . . .
  • 33. Solution 1. Everybody understand? . . . . . .
  • 34. 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 800 m of wire at your disposal, what is the largest area you can enclose, and what are its dimensions? . . . . . .
  • 35. 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 800 m 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 . . . . . .
  • 36. 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 800 m 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 . . . . . .
  • 37. Solution 1. Everybody understand? . . . . . .
  • 38. Solution 1. Everybody understand? 2. Draw a diagram. . . . . . .
  • 39. 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? . . . . . . . . . .
  • 40. Solution 1. Everybody understand? 2. Draw a diagram. . . . . . .
  • 41. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: Length and width are ℓ and w. Length of wire used is p. . . . . . .
  • 42. 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? . . . . . . . . . .
  • 43. 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 . . . . . . . . . . .
  • 44. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: Length and width are ℓ and w. Length of wire used is p. . . . . . .
  • 45. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: Length and width are ℓ and w. Length of wire used is p. 4. Q = area = ℓw. . . . . . .
  • 46. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: 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] . . . . . .
  • 47. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: 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 = p − 4w, which is zero when w = . 6. dw 4 . . . . . .
  • 48. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: 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 = p − 4w, which is zero when w = . 6. dw 4 . . . . . .
  • 49. Solution 1. Everybody understand? 2. Draw a diagram. 3. Introduce notation: 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 = p − 4w, which is zero when w = . 6. dw 4 Q(0) = Q(p/2) = 0, but (p) p2 p2 p = 80, 000m2 =p· −2· Q = 4 4 16 8 so the critical point is the absolute maximum. . . . . . .
  • 50. 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? . . . . . .
  • 51. 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. . . . . . .
  • 52. . . w . . . ℓ A = ℓw ≡ 216 f = 2ℓ + 3w . . . . . .
  • 53. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on w (0, ∞). . . . . . .
  • 54. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on w (0, ∞). We have df 2A =− 2 +3 dw w √ 2A which is zero when w = . 3 . . . . . .
  • 55. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on w (0, ∞). 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. . . . . . .
  • 56. Solution (Continued) 2A We need to find the minimum value of f(w) = + 3w on w (0, ∞). 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 2A 2A = 2 6A = 2 6 · 216 = 72m f = 2· +3 3 2 3 . . . . . .
  • 57. Example A Norman window has the outline of a semicircle on top of a rectangle. Suppose there is 8 + 2π feet of wood trim available. Find the dimensions of the rectangle and semicircle that will maximize the area of the window. . . . . . . .
  • 58. Example A Norman window has the outline of a semicircle on top of a rectangle. Suppose there is 8 + 2π feet of wood trim available. Find the dimensions of the rectangle and semicircle that will maximize the area of the window. . Answer The dimensions are 4ft by 2ft. . . . . . .
  • 59. Solution Let h and w be the height and width of the window. We have π ( w )2 π L = 2h + w + w A = wh + 2 22 If L is fixed to be 8 + 2π, we have 16 + 4π − 2w − πw h= , 4 so ( ) w 1π π A = (16 + 4π − 2w − πw) + w2 = (π + 4)w − w2 . + 4 8 28 ( ) π So A′ = (π + 4)w − 1 + , which is zero when 4 π+4 w= = 4 ft. The dimensions are 4ft by 2ft. 1+ π2 . . . . . .
  • 60. Summary Remember the checklist Ask yourself: what is the objective? Remember your geometry: similar triangles right triangles trigonometric functions . . . . . .