SlideShare une entreprise Scribd logo
1  sur  9
Télécharger pour lire hors ligne
Section 4.4
Optimization Problems
V63.0121.021, Calculus I
New York University
November 23, 2010
Announcements
Turn in HW anytime between now and November 24, 2pm
No Thursday recitation this week
Quiz 4 on §§4.1–4.4 next week in recitation
Announcements
Turn in HW anytime
between now and November
24, 2pm
No Thursday recitation this
week
Quiz 4 on §§4.1–4.4 next
week in recitation
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 2 / 31
Objectives
Given a problem requiring
optimization, identify the
objective functions,
variables, and constraints.
Solve optimization problems
with calculus.
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 3 / 31
Notes
Notes
Notes
1
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
Outline
Leading by Example
The Text in the Box
More Examples
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 4 / 31
Leading by Example
Example
What is the rectangle of fixed perimeter with maximum area?
Solution
Draw a rectangle.
w
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 5 / 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.
Since p = 2 + 2w, we have =
p − 2w
2
, so
A = w =
p − 2w
2
· w =
1
2
(p − 2w)(w) =
1
2
pw − w2
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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 6 / 31
Notes
Notes
Notes
2
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
Solution Concluded
We use the Closed Interval Method for A(w) =
1
2
pw − w2
on [0, p/2].
At the endpoints, A(0) = A(p/2) = 0.
To find the critical points, we find
dA
dw
=
1
2
p − 2w.
The critical points are when
0 =
1
2
p − 2w =⇒ w =
p
4
Since this is the only critical point, it must be the maximum. In this
case =
p
4
as well.
We have a square! The maximal area is A(p/4) = p2
/16.
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 7 / 31
Outline
Leading by Example
The Text in the Box
More Examples
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 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¨orgy P´olya
(Hungarian, 1887–1985)
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 9 / 31
Notes
Notes
Notes
3
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 10 / 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 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.
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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 13 / 31
Notes
Notes
Notes
4
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
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
fV63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 14 / 31
Which to use when?
CIM 1DT 2DT
Pro – no need for
inequalities
– gets global extrema
automatically
– works on
non-closed,
non-bounded
intervals
– only one derivative
– works on
non-closed,
non-bounded
intervals
– no need for
inequalities
Con – only for closed
bounded intervals
– Uses inequalities
– More work at
boundary than CIM
– More derivatives
– less conclusive 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 15 / 31
Outline
Leading by Example
The Text in the Box
More Examples
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 16 / 31
Notes
Notes
Notes
5
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 17 / 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]
6.
dQ
dw
= p − 4w, which is zero when w =
p
4
. Q(0) = Q(p/2) = 0, but
Q
p
4
= p ·
p
4
− 2 ·
p2
16
=
p2
8
= 80, 000m2
so the critical point is the absolute maximum.
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 18 / 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 21 / 31
Notes
Notes
Notes
6
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
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
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 25 / 31
Diagram
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 26 / 31
Solution (Continued)
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 27 / 31
Notes
Notes
Notes
7
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 28 / 31
Solution
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 29 / 31
Solution (Concluded)
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 30 / 31
Notes
Notes
Notes
8
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
Summary
Remember the checklist
Ask yourself: what is the
objective?
Remember your geometry:
similar triangles
right triangles
trigonometric functions
V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 31 / 31
Notes
Notes
Notes
9
Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010

Contenu connexe

Tendances

1575 numerical differentiation and integration
1575 numerical differentiation and integration1575 numerical differentiation and integration
1575 numerical differentiation and integrationDr Fereidoun Dejahang
 
Branch and bounding : Data structures
Branch and bounding : Data structuresBranch and bounding : Data structures
Branch and bounding : Data structuresKàŕtheek Jåvvàjí
 
Pixel Relationships Examples
Pixel Relationships ExamplesPixel Relationships Examples
Pixel Relationships ExamplesMarwa Ahmeid
 
Introductory maths analysis chapter 08 official
Introductory maths analysis   chapter 08 officialIntroductory maths analysis   chapter 08 official
Introductory maths analysis chapter 08 officialEvert Sandye Taasiringan
 
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...qyjewyvu
 
8.further calculus Further Mathematics Zimbabwe Zimsec Cambridge
8.further calculus   Further Mathematics Zimbabwe Zimsec Cambridge8.further calculus   Further Mathematics Zimbabwe Zimsec Cambridge
8.further calculus Further Mathematics Zimbabwe Zimsec Cambridgealproelearning
 
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)Matthew Leingang
 
Introductory maths analysis chapter 14 official
Introductory maths analysis   chapter 14 officialIntroductory maths analysis   chapter 14 official
Introductory maths analysis chapter 14 officialEvert Sandye Taasiringan
 
Introductory maths analysis chapter 13 official
Introductory maths analysis   chapter 13 officialIntroductory maths analysis   chapter 13 official
Introductory maths analysis chapter 13 officialEvert Sandye Taasiringan
 
Sec 3 E Maths Notes Coordinate Geometry
Sec 3 E Maths Notes Coordinate GeometrySec 3 E Maths Notes Coordinate Geometry
Sec 3 E Maths Notes Coordinate GeometryMath Academy Singapore
 
Indefinite Integral
Indefinite IntegralIndefinite Integral
Indefinite IntegralJelaiAujero
 
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
 
Introductory maths analysis chapter 12 official
Introductory maths analysis   chapter 12 officialIntroductory maths analysis   chapter 12 official
Introductory maths analysis chapter 12 officialEvert Sandye Taasiringan
 
Introductory maths analysis chapter 04 official
Introductory maths analysis   chapter 04 officialIntroductory maths analysis   chapter 04 official
Introductory maths analysis chapter 04 officialEvert Sandye Taasiringan
 
Introductory maths analysis chapter 15 official
Introductory maths analysis   chapter 15 officialIntroductory maths analysis   chapter 15 official
Introductory maths analysis chapter 15 officialEvert Sandye Taasiringan
 

Tendances (18)

1575 numerical differentiation and integration
1575 numerical differentiation and integration1575 numerical differentiation and integration
1575 numerical differentiation and integration
 
Branch and bounding : Data structures
Branch and bounding : Data structuresBranch and bounding : Data structures
Branch and bounding : Data structures
 
Pixel Relationships Examples
Pixel Relationships ExamplesPixel Relationships Examples
Pixel Relationships Examples
 
Introductory maths analysis chapter 08 official
Introductory maths analysis   chapter 08 officialIntroductory maths analysis   chapter 08 official
Introductory maths analysis chapter 08 official
 
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...
Applied Statistics and Probability for Engineers 6th Edition Montgomery Solut...
 
Chapter 3
Chapter 3Chapter 3
Chapter 3
 
8.further calculus Further Mathematics Zimbabwe Zimsec Cambridge
8.further calculus   Further Mathematics Zimbabwe Zimsec Cambridge8.further calculus   Further Mathematics Zimbabwe Zimsec Cambridge
8.further calculus Further Mathematics Zimbabwe Zimsec Cambridge
 
The integral
The integralThe integral
The integral
 
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 021 handout)
 
Introductory maths analysis chapter 14 official
Introductory maths analysis   chapter 14 officialIntroductory maths analysis   chapter 14 official
Introductory maths analysis chapter 14 official
 
Introductory maths analysis chapter 13 official
Introductory maths analysis   chapter 13 officialIntroductory maths analysis   chapter 13 official
Introductory maths analysis chapter 13 official
 
Unit 5 jwfiles
Unit 5 jwfilesUnit 5 jwfiles
Unit 5 jwfiles
 
Sec 3 E Maths Notes Coordinate Geometry
Sec 3 E Maths Notes Coordinate GeometrySec 3 E Maths Notes Coordinate Geometry
Sec 3 E Maths Notes Coordinate Geometry
 
Indefinite Integral
Indefinite IntegralIndefinite Integral
Indefinite Integral
 
Introductory maths analysis chapter 09 official
Introductory maths analysis   chapter 09 officialIntroductory maths analysis   chapter 09 official
Introductory maths analysis chapter 09 official
 
Introductory maths analysis chapter 12 official
Introductory maths analysis   chapter 12 officialIntroductory maths analysis   chapter 12 official
Introductory maths analysis chapter 12 official
 
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 15 official
Introductory maths analysis   chapter 15 officialIntroductory maths analysis   chapter 15 official
Introductory maths analysis chapter 15 official
 

Similaire à Lesson 22: Optimization (Section 021 handout)

Lesson 22: Optimization II (Section 041 handout)
Lesson 22: Optimization II (Section 041 handout)Lesson 22: Optimization II (Section 041 handout)
Lesson 22: Optimization II (Section 041 handout)Matthew Leingang
 
Lesson 18: Maximum and Minimum Values (Section 021 handout)
Lesson 18: Maximum and Minimum Values (Section 021 handout)Lesson 18: Maximum and Minimum Values (Section 021 handout)
Lesson 18: Maximum and Minimum Values (Section 021 handout)Matthew Leingang
 
Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Matthew Leingang
 
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
 
Lesson 22: Optimization II (Section 041 slides)
Lesson 22: Optimization II (Section 041 slides)Lesson 22: Optimization II (Section 041 slides)
Lesson 22: Optimization II (Section 041 slides)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 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 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)Matthew Leingang
 
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 18: Maximum and Minimum Values (Section 021 slides)
Lesson 18: Maximum and Minimum Values (Section 021 slides)Lesson 18: Maximum and Minimum Values (Section 021 slides)
Lesson 18: Maximum and Minimum Values (Section 021 slides)Matthew Leingang
 
Lesson 18: Maximum and Minimum Values (Section 041 handout)
Lesson 18: Maximum and Minimum Values (Section 041 handout)Lesson 18: Maximum and Minimum Values (Section 041 handout)
Lesson 18: Maximum and Minimum Values (Section 041 handout)Matthew Leingang
 
Lesson 18: Maximum and Minimum Values (Section 041 slides)
Lesson 18: Maximum and Minimum Values (Section 041 slides)Lesson 18: Maximum and Minimum Values (Section 041 slides)
Lesson 18: Maximum and Minimum Values (Section 041 slides)Matthew Leingang
 
Lesson22 -optimization_problems_slides
Lesson22  -optimization_problems_slidesLesson22  -optimization_problems_slides
Lesson22 -optimization_problems_slidesMatthew Leingang
 
Lesson22 -optimization_problems_slides
Lesson22 -optimization_problems_slidesLesson22 -optimization_problems_slides
Lesson22 -optimization_problems_slidesMel Anthony Pepito
 
Certified global minima
Certified global minimaCertified global minima
Certified global minimassuserfa7e73
 
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 25: The Fundamental Theorem of Calculus
Lesson 25: The Fundamental Theorem of CalculusLesson 25: The Fundamental Theorem of Calculus
Lesson 25: The Fundamental Theorem of CalculusMatthew Leingang
 
Lesson20 -derivatives_and_the_shape_of_curves_021_slides
Lesson20  -derivatives_and_the_shape_of_curves_021_slidesLesson20  -derivatives_and_the_shape_of_curves_021_slides
Lesson20 -derivatives_and_the_shape_of_curves_021_slidesMatthew 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
 
Lesson18 -maximum_and_minimum_values_slides
Lesson18  -maximum_and_minimum_values_slidesLesson18  -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slidesMatthew Leingang
 

Similaire à Lesson 22: Optimization (Section 021 handout) (20)

Lesson 22: Optimization II (Section 041 handout)
Lesson 22: Optimization II (Section 041 handout)Lesson 22: Optimization II (Section 041 handout)
Lesson 22: Optimization II (Section 041 handout)
 
Lesson 18: Maximum and Minimum Values (Section 021 handout)
Lesson 18: Maximum and Minimum Values (Section 021 handout)Lesson 18: Maximum and Minimum Values (Section 021 handout)
Lesson 18: Maximum and Minimum Values (Section 021 handout)
 
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 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)
 
Lesson 22: Optimization II (Section 041 slides)
Lesson 22: Optimization II (Section 041 slides)Lesson 22: Optimization II (Section 041 slides)
Lesson 22: Optimization II (Section 041 slides)
 
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 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 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 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)
 
Lesson 18: Maximum and Minimum Values (Section 021 slides)
Lesson 18: Maximum and Minimum Values (Section 021 slides)Lesson 18: Maximum and Minimum Values (Section 021 slides)
Lesson 18: Maximum and Minimum Values (Section 021 slides)
 
Lesson 18: Maximum and Minimum Values (Section 041 handout)
Lesson 18: Maximum and Minimum Values (Section 041 handout)Lesson 18: Maximum and Minimum Values (Section 041 handout)
Lesson 18: Maximum and Minimum Values (Section 041 handout)
 
Lesson 18: Maximum and Minimum Values (Section 041 slides)
Lesson 18: Maximum and Minimum Values (Section 041 slides)Lesson 18: Maximum and Minimum Values (Section 041 slides)
Lesson 18: Maximum and Minimum Values (Section 041 slides)
 
Lesson22 -optimization_problems_slides
Lesson22  -optimization_problems_slidesLesson22  -optimization_problems_slides
Lesson22 -optimization_problems_slides
 
Lesson22 -optimization_problems_slides
Lesson22 -optimization_problems_slidesLesson22 -optimization_problems_slides
Lesson22 -optimization_problems_slides
 
Certified global minima
Certified global minimaCertified global minima
Certified global minima
 
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 25: The Fundamental Theorem of Calculus
Lesson 25: The Fundamental Theorem of CalculusLesson 25: The Fundamental Theorem of Calculus
Lesson 25: The Fundamental Theorem of Calculus
 
Lesson20 -derivatives_and_the_shape_of_curves_021_slides
Lesson20  -derivatives_and_the_shape_of_curves_021_slidesLesson20  -derivatives_and_the_shape_of_curves_021_slides
Lesson20 -derivatives_and_the_shape_of_curves_021_slides
 
Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)Lesson 26: Integration by Substitution (handout)
Lesson 26: Integration by Substitution (handout)
 
Lesson18 -maximum_and_minimum_values_slides
Lesson18  -maximum_and_minimum_values_slidesLesson18  -maximum_and_minimum_values_slides
Lesson18 -maximum_and_minimum_values_slides
 

Plus de 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
 
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
 
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 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
 
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 (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (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
 

Plus de Matthew Leingang (20)

Making Lesson Plans
Making Lesson PlansMaking Lesson Plans
Making Lesson Plans
 
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
 
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)
 
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 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)
 
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 (slides)
Lesson 22: Optimization Problems (slides)Lesson 22: Optimization Problems (slides)
Lesson 22: Optimization Problems (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)
 

Dernier

Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfinfogdgmi
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopBachir Benyammi
 
How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?IES VE
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationIES VE
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8DianaGray10
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URLRuncy Oommen
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsSeth Reyes
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.YounusS2
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAshyamraj55
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintMahmoud Rabie
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6DianaGray10
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesDavid Newbury
 
Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Adtran
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfDaniel Santiago Silva Capera
 

Dernier (20)

Videogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdfVideogame localization & technology_ how to enhance the power of translation.pdf
Videogame localization & technology_ how to enhance the power of translation.pdf
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
NIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 WorkshopNIST Cybersecurity Framework (CSF) 2.0 Workshop
NIST Cybersecurity Framework (CSF) 2.0 Workshop
 
How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?How Accurate are Carbon Emissions Projections?
How Accurate are Carbon Emissions Projections?
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve DecarbonizationUsing IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
Using IESVE for Loads, Sizing and Heat Pump Modeling to Achieve Decarbonization
 
UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8UiPath Studio Web workshop series - Day 8
UiPath Studio Web workshop series - Day 8
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 
Designing A Time bound resource download URL
Designing A Time bound resource download URLDesigning A Time bound resource download URL
Designing A Time bound resource download URL
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
Computer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and HazardsComputer 10: Lesson 10 - Online Crimes and Hazards
Computer 10: Lesson 10 - Online Crimes and Hazards
 
Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.Basic Building Blocks of Internet of Things.
Basic Building Blocks of Internet of Things.
 
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPAAnypoint Code Builder , Google Pub sub connector and MuleSoft RPA
Anypoint Code Builder , Google Pub sub connector and MuleSoft RPA
 
Empowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership BlueprintEmpowering Africa's Next Generation: The AI Leadership Blueprint
Empowering Africa's Next Generation: The AI Leadership Blueprint
 
UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6UiPath Studio Web workshop series - Day 6
UiPath Studio Web workshop series - Day 6
 
Linked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond OntologiesLinked Data in Production: Moving Beyond Ontologies
Linked Data in Production: Moving Beyond Ontologies
 
Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™Meet the new FSP 3000 M-Flex800™
Meet the new FSP 3000 M-Flex800™
 
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdfIaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
IaC & GitOps in a Nutshell - a FridayInANuthshell Episode.pdf
 

Lesson 22: Optimization (Section 021 handout)

  • 1. Section 4.4 Optimization Problems V63.0121.021, Calculus I New York University November 23, 2010 Announcements Turn in HW anytime between now and November 24, 2pm No Thursday recitation this week Quiz 4 on §§4.1–4.4 next week in recitation Announcements Turn in HW anytime between now and November 24, 2pm No Thursday recitation this week Quiz 4 on §§4.1–4.4 next week in recitation V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 2 / 31 Objectives Given a problem requiring optimization, identify the objective functions, variables, and constraints. Solve optimization problems with calculus. V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 3 / 31 Notes Notes Notes 1 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 2. Outline Leading by Example The Text in the Box More Examples V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 4 / 31 Leading by Example Example What is the rectangle of fixed perimeter with maximum area? Solution Draw a rectangle. w V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 5 / 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. Since p = 2 + 2w, we have = p − 2w 2 , so A = w = p − 2w 2 · w = 1 2 (p − 2w)(w) = 1 2 pw − w2 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 6 / 31 Notes Notes Notes 2 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 3. Solution Concluded We use the Closed Interval Method for A(w) = 1 2 pw − w2 on [0, p/2]. At the endpoints, A(0) = A(p/2) = 0. To find the critical points, we find dA dw = 1 2 p − 2w. The critical points are when 0 = 1 2 p − 2w =⇒ w = p 4 Since this is the only critical point, it must be the maximum. In this case = p 4 as well. We have a square! The maximal area is A(p/4) = p2 /16. V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 7 / 31 Outline Leading by Example The Text in the Box More Examples V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 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¨orgy P´olya (Hungarian, 1887–1985) V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 9 / 31 Notes Notes Notes 3 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 4. 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 10 / 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 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. 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 13 / 31 Notes Notes Notes 4 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 5. 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 fV63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 14 / 31 Which to use when? CIM 1DT 2DT Pro – no need for inequalities – gets global extrema automatically – works on non-closed, non-bounded intervals – only one derivative – works on non-closed, non-bounded intervals – no need for inequalities Con – only for closed bounded intervals – Uses inequalities – More work at boundary than CIM – More derivatives – less conclusive 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 15 / 31 Outline Leading by Example The Text in the Box More Examples V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 16 / 31 Notes Notes Notes 5 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 6. 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 17 / 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] 6. dQ dw = p − 4w, which is zero when w = p 4 . Q(0) = Q(p/2) = 0, but Q p 4 = p · p 4 − 2 · p2 16 = p2 8 = 80, 000m2 so the critical point is the absolute maximum. V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 18 / 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 21 / 31 Notes Notes Notes 6 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 7. 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 V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 25 / 31 Diagram V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 26 / 31 Solution (Continued) V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 27 / 31 Notes Notes Notes 7 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 8. 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.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 28 / 31 Solution V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 29 / 31 Solution (Concluded) V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 30 / 31 Notes Notes Notes 8 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010
  • 9. Summary Remember the checklist Ask yourself: what is the objective? Remember your geometry: similar triangles right triangles trigonometric functions V63.0121.021, Calculus I (NYU) Section 4.4 Optimization Problems November 23, 2010 31 / 31 Notes Notes Notes 9 Section 4.4 : Optimization ProblemsV63.0121.021, Calculus I November 23, 2010