SlideShare a Scribd company logo
1 of 58
Download to read offline
Section 4.5
Optimization II
V63.0121.041, Calculus I
New York University
November 24, 2010
Announcements
No recitation this week
Quiz 5 on §§4.1–4.4 next week in recitation
Happy Thanksgiving!
. . . . . .
. . . . . .
Announcements
No recitation this week
Quiz 5 on §§4.1–4.4 next
week in recitation
Happy Thanksgiving!
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 2 / 25
. . . . . .
Objectives
Given a problem requiring
optimization, identify the
objective functions,
variables, and constraints.
Solve optimization
problems with calculus.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 3 / 25
. . . . . .
Outline
Recall
More examples
Addition
Distance
Triangles
Economics
The Statue of Liberty
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 4 / 25
. . . . . .
Checklist for optimization problems
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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 5 / 25
. . . . . .
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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 6 / 25
. . . . . .
Recall: The First Derivative Test
See Section 4.3
Theorem (The First Derivative Test)
Let f be continuous on (a, b) and c a critical point of f in (a, b).
If f′
changes from negative to positive at c, then c is a local
minimum.
If f′
changes from positive to negative at c, then c is a local
maximum.
If f′
does not change sign at c, then c is not a local extremum.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 7 / 25
. . . . . .
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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 7 / 25
. . . . . .
Recall: The Second Derivative Test
See Section 4.3
Theorem (The Second Derivative Test)
Let f, f′
, and f′′
be continuous on [a, b]. Let c be in (a, b) with f′
(c) = 0.
If f′′
(c) < 0, then f(c) is a local maximum.
If f′′
(c) > 0, then f(c) is a local minimum.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
. . . . . .
Recall: The Second Derivative Test
See Section 4.3
Theorem (The Second Derivative Test)
Let f, f′
, and f′′
be continuous on [a, b]. Let c be in (a, b) with f′
(c) = 0.
If f′′
(c) < 0, then f(c) is a local maximum.
If f′′
(c) > 0, then f(c) is a local minimum.
Warning
If f′′
(c) = 0, the second derivative test is inconclusive (this does not
mean c is neither; we just don’t know yet).
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
. . . . . .
Recall: The Second Derivative Test
See Section 4.3
Theorem (The Second Derivative Test)
Let f, f′
, and f′′
be continuous on [a, b]. Let c be in (a, b) with f′
(c) = 0.
If f′′
(c) < 0, then f(c) is a local maximum.
If f′′
(c) > 0, then f(c) is a local minimum.
Warning
If f′′
(c) = 0, the second derivative test is inconclusive (this does not
mean c is neither; we just don’t know yet).
Corollary
If f′
(c) = 0 and f′′
(x) > 0 for all x, then c is the global minimum of f
If f′
(c) = 0 and f′′
(x) < 0 for all x, then c is the global maximum of f
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
. . . . . .
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
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 9 / 25
. . . . . .
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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 9 / 25
. . . . . .
Outline
Recall
More examples
Addition
Distance
Triangles
Economics
The Statue of Liberty
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 10 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
Solution
Objective: minimize S = x + y subject to the constraint that
xy = 16
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
Solution
Objective: minimize S = x + y subject to the constraint that
xy = 16
Eliminate y: y = 16/x so S = x + 16/x. The domain of
consideration is (0, ∞).
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
Solution
Objective: minimize S = x + y subject to the constraint that
xy = 16
Eliminate y: y = 16/x so S = x + 16/x. The domain of
consideration is (0, ∞).
Find the critical points: S′
(x) = 1 − 16/x2
, which is 0 when x = 4.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
Solution
Objective: minimize S = x + y subject to the constraint that
xy = 16
Eliminate y: y = 16/x so S = x + 16/x. The domain of
consideration is (0, ∞).
Find the critical points: S′
(x) = 1 − 16/x2
, which is 0 when x = 4.
Classify the critical points: S′′
(x) = 32/x3
, which is always
positive. So the graph is always concave up, 4 is a local min, and
therefore the global min.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Addition with a constraint
Example
Find two positive numbers x and y with xy = 16 and x + y as small as
possible.
Solution
Objective: minimize S = x + y subject to the constraint that
xy = 16
Eliminate y: y = 16/x so S = x + 16/x. The domain of
consideration is (0, ∞).
Find the critical points: S′
(x) = 1 − 16/x2
, which is 0 when x = 4.
Classify the critical points: S′′
(x) = 32/x3
, which is always
positive. So the graph is always concave up, 4 is a local min, and
therefore the global min.
So the numbers are x = y = 4, Smin = 8.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
Solution
.. x.
y
..
(x, x2
)
..
3
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
Solution
The distance between (x, x2
)
and (3, 0) is given by
f(x) =
√
(x − 3)2 + (x2 − 0)2
.. x.
y
..
(x, x2
)
..
3
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
Solution
The distance between (x, x2
)
and (3, 0) is given by
f(x) =
√
(x − 3)2 + (x2 − 0)2
We may instead minimize the
square of f:
g(x) = f(x)2
= (x − 3)2
+ x4
.. x.
y
..
(x, x2
)
..
3
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
Solution
The distance between (x, x2
)
and (3, 0) is given by
f(x) =
√
(x − 3)2 + (x2 − 0)2
We may instead minimize the
square of f:
g(x) = f(x)2
= (x − 3)2
+ x4
The domain is (−∞, ∞).
.. x.
y
..
(x, x2
)
..
3
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
g′
(x) = 2(x − 3) + 4x3
= 4x3
+ 2x − 6 = 2(2x3
+ x − 3)
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
g′
(x) = 2(x − 3) + 4x3
= 4x3
+ 2x − 6 = 2(2x3
+ x − 3)
If a polynomial has integer roots, they are factors of the constant
term (Euler)
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
g′
(x) = 2(x − 3) + 4x3
= 4x3
+ 2x − 6 = 2(2x3
+ x − 3)
If a polynomial has integer roots, they are factors of the constant
term (Euler)
1 is a root, so 2x3
+ x − 3 is divisible by x − 1:
f′
(x) = 2(2x3
+ x − 3) = 2(x − 1)(2x2
+ 2x + 3)
The quadratic has no real roots (the discriminant b2
− 4ac < 0)
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
g′
(x) = 2(x − 3) + 4x3
= 4x3
+ 2x − 6 = 2(2x3
+ x − 3)
If a polynomial has integer roots, they are factors of the constant
term (Euler)
1 is a root, so 2x3
+ x − 3 is divisible by x − 1:
f′
(x) = 2(2x3
+ x − 3) = 2(x − 1)(2x2
+ 2x + 3)
The quadratic has no real roots (the discriminant b2
− 4ac < 0)
We see f′
(1) = 0, f′
(x) < 0 if x < 1, and f′
(x) > 0 if x > 1. So 1 is
the global minimum.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
g′
(x) = 2(x − 3) + 4x3
= 4x3
+ 2x − 6 = 2(2x3
+ x − 3)
If a polynomial has integer roots, they are factors of the constant
term (Euler)
1 is a root, so 2x3
+ x − 3 is divisible by x − 1:
f′
(x) = 2(2x3
+ x − 3) = 2(x − 1)(2x2
+ 2x + 3)
The quadratic has no real roots (the discriminant b2
− 4ac < 0)
We see f′
(1) = 0, f′
(x) < 0 if x < 1, and f′
(x) > 0 if x > 1. So 1 is
the global minimum.
The point on the parabola closest to (3, 0) is (1, 1). The minimum
distance is
√
5.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
. . . . . .
Remark
We’ve used each of the methods (CIM, 1DT, 2DT) so far.
Notice how we argued that the critical points were absolute
extremes even though 1DT and 2DT only tell you relative/local
extremes.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 14 / 25
. . . . . .
A problem with a triangle
..
Example
Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two
sides on legs of the triangle and one vertex on the hypotenuse.
Solution
..
3
.
4
.
5
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
. . . . . .
A problem with a triangle
..
Example
Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two
sides on legs of the triangle and one vertex on the hypotenuse.
Solution
Let the dimensions of the
rectangle be x and y.
..
3
.
4
.
5
.
y
.
x
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
. . . . . .
A problem with a triangle
..
Example
Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two
sides on legs of the triangle and one vertex on the hypotenuse.
Solution
Let the dimensions of the
rectangle be x and y.
Similar triangles give
y
3 − x
=
4
3
=⇒ 3y = 4(3 − x)
..
3
.
4
.
5
.
y
.
x
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
. . . . . .
A problem with a triangle
..
Example
Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two
sides on legs of the triangle and one vertex on the hypotenuse.
Solution
Let the dimensions of the
rectangle be x and y.
Similar triangles give
y
3 − x
=
4
3
=⇒ 3y = 4(3 − x)
So y = 4 −
4
3
x and
A(x) = x
(
4 −
4
3
x
)
= 4x−
4
3
x2 ..
3
.
4
.
5
.
y
.
x
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
. . . . . .
Triangle Problem
maximization step
We want to find the absolute maximum of A(x) = 4x −
4
3
x2
on the
interval [0, 3].
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
. . . . . .
Triangle Problem
maximization step
We want to find the absolute maximum of A(x) = 4x −
4
3
x2
on the
interval [0, 3].
A(0) = A(3) = 0
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
. . . . . .
Triangle Problem
maximization step
We want to find the absolute maximum of A(x) = 4x −
4
3
x2
on the
interval [0, 3].
A(0) = A(3) = 0
A′
(x) = 4 −
8
3
x, which is zero when x =
12
8
= 1.5.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
. . . . . .
Triangle Problem
maximization step
We want to find the absolute maximum of A(x) = 4x −
4
3
x2
on the
interval [0, 3].
A(0) = A(3) = 0
A′
(x) = 4 −
8
3
x, which is zero when x =
12
8
= 1.5.
Since A(1.5) = 3, this is the absolute maximum.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
. . . . . .
Triangle Problem
maximization step
We want to find the absolute maximum of A(x) = 4x −
4
3
x2
on the
interval [0, 3].
A(0) = A(3) = 0
A′
(x) = 4 −
8
3
x, which is zero when x =
12
8
= 1.5.
Since A(1.5) = 3, this is the absolute maximum.
So the dimensions of the rectangle of maximal area are 1.5 × 2.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
. . . . . .
An Economics problem
Example
Let r be the monthly rent per unit in an apartment building with 100
units. A survey reveals that all units can be rented when r = 900 and
that one unit becomes vacant with each 10 increase in rent. Suppose
the average monthly maintenance costs per occupied unit is
$100/month. What rent should be charged to maximize profit?
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 17 / 25
. . . . . .
An Economics problem
Example
Let r be the monthly rent per unit in an apartment building with 100
units. A survey reveals that all units can be rented when r = 900 and
that one unit becomes vacant with each 10 increase in rent. Suppose
the average monthly maintenance costs per occupied unit is
$100/month. What rent should be charged to maximize profit?
Solution
Let n be the number of units rented, depending on price (the
demand function).
We have n(900) = 100 and
∆n
∆r
= −
1
10
. So
n − 100 = −
1
10
(r − 900) =⇒ n(r) = −
1
10
r + 190
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 17 / 25
. . . . . .
Economics Problem
Finishing the model and maximizing
The profit per unit rented is r − 100, so
P(r) = (r − 100)n(r) = (r − 100)
(
−
1
10
r + 190
)
= −
1
10
r2
+ 200r − 19000
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
. . . . . .
Economics Problem
Finishing the model and maximizing
The profit per unit rented is r − 100, so
P(r) = (r − 100)n(r) = (r − 100)
(
−
1
10
r + 190
)
= −
1
10
r2
+ 200r − 19000
We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?)
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
. . . . . .
Economics Problem
Finishing the model and maximizing
The profit per unit rented is r − 100, so
P(r) = (r − 100)n(r) = (r − 100)
(
−
1
10
r + 190
)
= −
1
10
r2
+ 200r − 19000
We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?)
A(900) = $800 × 100 = $80, 000, A(1900) = 0
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
. . . . . .
Economics Problem
Finishing the model and maximizing
The profit per unit rented is r − 100, so
P(r) = (r − 100)n(r) = (r − 100)
(
−
1
10
r + 190
)
= −
1
10
r2
+ 200r − 19000
We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?)
A(900) = $800 × 100 = $80, 000, A(1900) = 0
A′
(x) = −
1
5
r + 200, which is zero when r = 1000.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
. . . . . .
Economics Problem
Finishing the model and maximizing
The profit per unit rented is r − 100, so
P(r) = (r − 100)n(r) = (r − 100)
(
−
1
10
r + 190
)
= −
1
10
r2
+ 200r − 19000
We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?)
A(900) = $800 × 100 = $80, 000, A(1900) = 0
A′
(x) = −
1
5
r + 200, which is zero when r = 1000.
n(1000) = 90, so P(r) = $900 × 90 = $81, 000. This is the
maximum intake.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
. . . . . .
The Statue of Liberty
Example
The Statue of Liberty stands on top of a pedestal which is on top of on
old fort. The top of the pedestal is 47 m above ground level. The statue
itself measures 46 m from the top of the pedestal to the tip of the torch.
What distance should one stand away from the statue in order to
maximize the view of the statue? That is, what distance will maximize
the portion of the viewer’s vision taken up by the statue?
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 19 / 25
. . . . . .
The Statue of Liberty
Seting up the model
Solution
The angle subtended by the
statue in the viewer’s eye can
be expressed as
θ = arctan
(
a + b
x
)
−arctan
(
b
x
)
.
a
b
θ
x
The domain of θ is all positive real numbers x.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 20 / 25
. . . . . .
The Statue of Liberty
Finding the derivative
θ = arctan
(
a + b
x
)
− arctan
(
b
x
)
So
dθ
dx
=
1
1 +
(
a+b
x
)2
·
−(a + b)
x2
−
1
1 +
(
b
x
)2
·
−b
x2
=
b
x2 + b2
−
a + b
x2 + (a + b)2
=
[
x2 + (a + b)2
]
b − (a + b)
[
x2 + b2
]
(x2 + b2
)
[
x2 + (a + b)2
]
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 21 / 25
. . . . . .
The Statue of Liberty
Finding the critical points
dθ
dx
=
[
x2 + (a + b)2
]
b − (a + b)
[
x2 + b2
]
(x2 + b2
)
[
x2 + (a + b)2
]
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
. . . . . .
The Statue of Liberty
Finding the critical points
dθ
dx
=
[
x2 + (a + b)2
]
b − (a + b)
[
x2 + b2
]
(x2 + b2
)
[
x2 + (a + b)2
]
This derivative is zero if and only if the numerator is zero, so we
seek x such that
0 =
[
x2
+ (a + b)2
]
b − (a + b)
[
x2
+ b2
]
= a(ab + b2
− x2
)
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
. . . . . .
The Statue of Liberty
Finding the critical points
dθ
dx
=
[
x2 + (a + b)2
]
b − (a + b)
[
x2 + b2
]
(x2 + b2
)
[
x2 + (a + b)2
]
This derivative is zero if and only if the numerator is zero, so we
seek x such that
0 =
[
x2
+ (a + b)2
]
b − (a + b)
[
x2
+ b2
]
= a(ab + b2
− x2
)
The only positive solution is x =
√
b(a + b).
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
. . . . . .
The Statue of Liberty
Finding the critical points
dθ
dx
=
[
x2 + (a + b)2
]
b − (a + b)
[
x2 + b2
]
(x2 + b2
)
[
x2 + (a + b)2
]
This derivative is zero if and only if the numerator is zero, so we
seek x such that
0 =
[
x2
+ (a + b)2
]
b − (a + b)
[
x2
+ b2
]
= a(ab + b2
− x2
)
The only positive solution is x =
√
b(a + b).
Using the first derivative test, we see that dθ/dx > 0 if
0 < x <
√
b(a + b) and dθ/dx < 0 if x >
√
b(a + b).
So this is definitely the absolute maximum on (0, ∞).
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
. . . . . .
The Statue of Liberty
Final answer
If we substitute in the numerical dimensions given, we have
x =
√
(46)(93) ≈ 66.1 meters
This distance would put you pretty close to the front of the old fort
which lies at the base of the island.
Unfortunately, you’re not allowed to walk on this part of the lawn.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 23 / 25
. . . . . .
The Statue of Liberty
Discussion
The length
√
b(a + b) is the geometric mean of the two distances
measured from the ground—to the top of the pedestal (a) and the
top of the statue (a + b).
The geometric mean is of two numbers is always between them
and greater than or equal to their average.
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 24 / 25
. . . . . .
Summary
Remember the checklist
Ask yourself: what is the
objective?
Remember your geometry:
similar triangles
right triangles
trigonometric functions
Name [_
Problem Solving Strategy
Draw a Picture
Kathy had a box of 8 crayons.
She gave some crayons away.
She has 5 left.
How many crayons did Kathy give away?
UNDERSTAND
•
What do you want to find out?
Draw a line under the question.
You can draw a picture
to solve the problem.
crayons
What number do I
add to 5 to get 8?
8 - = 5
5 + 3 = 8
CHECK
Does your answer make sense?
Explain.
Draw a picture to solve the problem.
Write how many were given away.
I. I had10 pencils.
I gave some away.
I have 3left. How many
pencils did I give away?
~7
What number
do I add to 3
to make 10?
13
i
ft
ill
:i
i ?
11
ft
I
'•'
«
I
I
ft A
H 11
M i l
U U U U> U U
I I
V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 25 / 25

More Related Content

What's hot

Lecture 7 quadratic equations
Lecture 7   quadratic equationsLecture 7   quadratic equations
Lecture 7 quadratic equationsnjit-ronbrown
 
Graphing parabola presentation
Graphing parabola presentationGraphing parabola presentation
Graphing parabola presentationVirgilio Paragele
 
19 more parabolas a&amp; hyperbolas (optional) x
19 more parabolas a&amp; hyperbolas (optional) x19 more parabolas a&amp; hyperbolas (optional) x
19 more parabolas a&amp; hyperbolas (optional) xmath260
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Matthew Leingang
 
Notes parabolas
Notes   parabolasNotes   parabolas
Notes parabolasLori Rapp
 
April 7, 2014
April 7, 2014April 7, 2014
April 7, 2014khyps13
 
Calculus a Functions of Several Variables
Calculus a Functions of Several Variables Calculus a Functions of Several Variables
Calculus a Functions of Several Variables Harington Dinklage
 
May 14, 2014
May 14, 2014May 14, 2014
May 14, 2014khyps13
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Matthew Leingang
 
Engr 371 final exam april 1996
Engr 371 final exam april 1996Engr 371 final exam april 1996
Engr 371 final exam april 1996amnesiann
 
Parabola Lesson Powerpoint Presentation
Parabola Lesson Powerpoint PresentationParabola Lesson Powerpoint Presentation
Parabola Lesson Powerpoint Presentationyanhiggins
 
Solving Problems Involving Radicals
Solving Problems Involving RadicalsSolving Problems Involving Radicals
Solving Problems Involving RadicalsCipriano De Leon
 
Properties of Parabola
Properties of ParabolaProperties of Parabola
Properties of Parabolarey castro
 
Pptpersamaankuadrat 150205080445-conversion-gate02
Pptpersamaankuadrat 150205080445-conversion-gate02Pptpersamaankuadrat 150205080445-conversion-gate02
Pptpersamaankuadrat 150205080445-conversion-gate02MasfuahFuah
 

What's hot (20)

Lecture 7 quadratic equations
Lecture 7   quadratic equationsLecture 7   quadratic equations
Lecture 7 quadratic equations
 
3rd Semester Electronic and Communication Engineering (June/July-2015) Questi...
3rd Semester Electronic and Communication Engineering (June/July-2015) Questi...3rd Semester Electronic and Communication Engineering (June/July-2015) Questi...
3rd Semester Electronic and Communication Engineering (June/July-2015) Questi...
 
Graphing parabola presentation
Graphing parabola presentationGraphing parabola presentation
Graphing parabola presentation
 
Parabola
ParabolaParabola
Parabola
 
19 more parabolas a&amp; hyperbolas (optional) x
19 more parabolas a&amp; hyperbolas (optional) x19 more parabolas a&amp; hyperbolas (optional) x
19 more parabolas a&amp; hyperbolas (optional) x
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
 
Mathematics xii paper 13 with answer with value vased questions
Mathematics xii paper 13 with answer with value vased questionsMathematics xii paper 13 with answer with value vased questions
Mathematics xii paper 13 with answer with value vased questions
 
Math cbse samplepaper
Math cbse samplepaperMath cbse samplepaper
Math cbse samplepaper
 
Notes parabolas
Notes   parabolasNotes   parabolas
Notes parabolas
 
April 7, 2014
April 7, 2014April 7, 2014
April 7, 2014
 
Calculus a Functions of Several Variables
Calculus a Functions of Several Variables Calculus a Functions of Several Variables
Calculus a Functions of Several Variables
 
May 14, 2014
May 14, 2014May 14, 2014
May 14, 2014
 
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
Lesson 14: Derivatives of Exponential and Logarithmic Functions (Section 041 ...
 
Parabola complete
Parabola completeParabola complete
Parabola complete
 
Engr 371 final exam april 1996
Engr 371 final exam april 1996Engr 371 final exam april 1996
Engr 371 final exam april 1996
 
1576 parabola
1576 parabola1576 parabola
1576 parabola
 
Parabola Lesson Powerpoint Presentation
Parabola Lesson Powerpoint PresentationParabola Lesson Powerpoint Presentation
Parabola Lesson Powerpoint Presentation
 
Solving Problems Involving Radicals
Solving Problems Involving RadicalsSolving Problems Involving Radicals
Solving Problems Involving Radicals
 
Properties of Parabola
Properties of ParabolaProperties of Parabola
Properties of Parabola
 
Pptpersamaankuadrat 150205080445-conversion-gate02
Pptpersamaankuadrat 150205080445-conversion-gate02Pptpersamaankuadrat 150205080445-conversion-gate02
Pptpersamaankuadrat 150205080445-conversion-gate02
 

Viewers also liked

Optimization: from mathematical tools to real applications
Optimization: from mathematical tools to real applicationsOptimization: from mathematical tools to real applications
Optimization: from mathematical tools to real applicationsPhilippe Laborie
 
Accelerating the Development of Efficient CP Optimizer Models
Accelerating the Development of Efficient CP Optimizer ModelsAccelerating the Development of Efficient CP Optimizer Models
Accelerating the Development of Efficient CP Optimizer ModelsPhilippe Laborie
 
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three ProblemsIBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three ProblemsPhilippe Laborie
 
Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Matthew Leingang
 
Lesson 20: Optimization (slides)
Lesson 20: Optimization (slides)Lesson 20: Optimization (slides)
Lesson 20: Optimization (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)Matthew Leingang
 
Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Matthew Leingang
 
Convex Optimization
Convex OptimizationConvex Optimization
Convex Optimizationadil raja
 
An introduction to CP Optimizer
An introduction to CP OptimizerAn introduction to CP Optimizer
An introduction to CP OptimizerPhilippe Laborie
 
Nonlinear Programming, Solved Problem
Nonlinear Programming, Solved ProblemNonlinear Programming, Solved Problem
Nonlinear Programming, Solved ProblemEdgar Mata
 
Lesson 19: Optimization Problems
Lesson 19: Optimization ProblemsLesson 19: Optimization Problems
Lesson 19: Optimization ProblemsMatthew Leingang
 
Goal Programming
Goal ProgrammingGoal Programming
Goal ProgrammingEvren E
 
NONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionNONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionOlympiad
 
Nonlinear programming 2013
Nonlinear programming 2013Nonlinear programming 2013
Nonlinear programming 2013sharifz
 
Lesson 23: Antiderivatives (Section 041 slides)
Lesson 23: Antiderivatives (Section 041 slides)Lesson 23: Antiderivatives (Section 041 slides)
Lesson 23: Antiderivatives (Section 041 slides)Matthew Leingang
 
Optimization Ppt
Optimization PptOptimization Ppt
Optimization Pptsarnoj
 
Ch. 2-optimization-techniques
Ch. 2-optimization-techniquesCh. 2-optimization-techniques
Ch. 2-optimization-techniquesanj134u
 

Viewers also liked (20)

Introduction to optimization Problems
Introduction to optimization ProblemsIntroduction to optimization Problems
Introduction to optimization Problems
 
Optimization: from mathematical tools to real applications
Optimization: from mathematical tools to real applicationsOptimization: from mathematical tools to real applications
Optimization: from mathematical tools to real applications
 
Accelerating the Development of Efficient CP Optimizer Models
Accelerating the Development of Efficient CP Optimizer ModelsAccelerating the Development of Efficient CP Optimizer Models
Accelerating the Development of Efficient CP Optimizer Models
 
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three ProblemsIBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
 
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 20: Optimization (slides)
Lesson 20: Optimization (slides)Lesson 20: Optimization (slides)
Lesson 20: Optimization (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 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)Lesson 22: Optimization (Section 041 handout)
Lesson 22: Optimization (Section 041 handout)
 
Convex Optimization
Convex OptimizationConvex Optimization
Convex Optimization
 
An introduction to CP Optimizer
An introduction to CP OptimizerAn introduction to CP Optimizer
An introduction to CP Optimizer
 
Nonlinear Programming, Solved Problem
Nonlinear Programming, Solved ProblemNonlinear Programming, Solved Problem
Nonlinear Programming, Solved Problem
 
Lesson 19: Optimization Problems
Lesson 19: Optimization ProblemsLesson 19: Optimization Problems
Lesson 19: Optimization Problems
 
Goal Programming
Goal ProgrammingGoal Programming
Goal Programming
 
NONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 IntroductionNONLINEAR PROGRAMMING - Lecture 1 Introduction
NONLINEAR PROGRAMMING - Lecture 1 Introduction
 
Nonlinear programming 2013
Nonlinear programming 2013Nonlinear programming 2013
Nonlinear programming 2013
 
Lesson 23: Antiderivatives (Section 041 slides)
Lesson 23: Antiderivatives (Section 041 slides)Lesson 23: Antiderivatives (Section 041 slides)
Lesson 23: Antiderivatives (Section 041 slides)
 
Optimization Ppt
Optimization PptOptimization Ppt
Optimization Ppt
 
Ch. 2-optimization-techniques
Ch. 2-optimization-techniquesCh. 2-optimization-techniques
Ch. 2-optimization-techniques
 
Optimization techniques
Optimization techniquesOptimization techniques
Optimization techniques
 
Integer programming
Integer programmingInteger programming
Integer programming
 

Similar to Lesson 22: Optimization II (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 20: Derivatives and the Shape of Curves (Section 041 slides)Matthew Leingang
 
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 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
 
Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)Matthew Leingang
 
Lesson 19: The Mean Value Theorem (Section 021 slides)
Lesson 19: The Mean Value Theorem (Section 021 slides)Lesson 19: The Mean Value Theorem (Section 021 slides)
Lesson 19: The Mean Value Theorem (Section 021 slides)Matthew Leingang
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)Matthew Leingang
 
Lesson 21: Curve Sketching (Section 041 handout)
Lesson 21: Curve Sketching (Section 041 handout)Lesson 21: Curve Sketching (Section 041 handout)
Lesson 21: Curve Sketching (Section 041 handout)Matthew Leingang
 
Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Matthew Leingang
 
Lesson 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 21: Curve Sketching (Section 021 handout)
Lesson 21: Curve Sketching (Section 021 handout)Lesson 21: Curve Sketching (Section 021 handout)
Lesson 21: Curve Sketching (Section 021 handout)Matthew Leingang
 
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 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 23: Antiderivatives (Section 021 handout)
Lesson 23: Antiderivatives (Section 021 handout)Lesson 23: Antiderivatives (Section 021 handout)
Lesson 23: Antiderivatives (Section 021 handout)Matthew Leingang
 
Lesson 23: Antiderivatives (Section 021 slides)
Lesson 23: Antiderivatives (Section 021 slides)Lesson 23: Antiderivatives (Section 021 slides)
Lesson 23: Antiderivatives (Section 021 slides)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
 
Lesson 21: Curve Sketching (Section 041 slides)
Lesson 21: Curve Sketching (Section 041 slides)Lesson 21: Curve Sketching (Section 041 slides)
Lesson 21: Curve Sketching (Section 041 slides)Mel Anthony Pepito
 
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_slidesMel Anthony Pepito
 
Lesson 15: Exponential Growth and Decay (Section 041 slides)
Lesson 15: Exponential Growth and Decay (Section 041 slides)Lesson 15: Exponential Growth and Decay (Section 041 slides)
Lesson 15: Exponential Growth and Decay (Section 041 slides)Matthew Leingang
 
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)Mel Anthony Pepito
 

Similar to Lesson 22: Optimization II (Section 041 slides) (20)

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 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 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)
 
Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)Lesson 22: Optimization (Section 021 handout)
Lesson 22: Optimization (Section 021 handout)
 
Lesson 19: The Mean Value Theorem (Section 021 slides)
Lesson 19: The Mean Value Theorem (Section 021 slides)Lesson 19: The Mean Value Theorem (Section 021 slides)
Lesson 19: The Mean Value Theorem (Section 021 slides)
 
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
Lesson 20: Derivatives and the Shape of Curves (Section 041 handout)
 
Lesson 21: Curve Sketching (Section 041 handout)
Lesson 21: Curve Sketching (Section 041 handout)Lesson 21: Curve Sketching (Section 041 handout)
Lesson 21: Curve Sketching (Section 041 handout)
 
Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)
 
Lesson 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 21: Curve Sketching (Section 021 handout)
Lesson 21: Curve Sketching (Section 021 handout)Lesson 21: Curve Sketching (Section 021 handout)
Lesson 21: Curve Sketching (Section 021 handout)
 
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 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 23: Antiderivatives (Section 021 handout)
Lesson 23: Antiderivatives (Section 021 handout)Lesson 23: Antiderivatives (Section 021 handout)
Lesson 23: Antiderivatives (Section 021 handout)
 
Lesson 23: Antiderivatives (Section 021 slides)
Lesson 23: Antiderivatives (Section 021 slides)Lesson 23: Antiderivatives (Section 021 slides)
Lesson 23: Antiderivatives (Section 021 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)
Lesson 18: Maximum and Minimum Values (Section 041 slides)
 
Lesson 21: Curve Sketching (Section 041 slides)
Lesson 21: Curve Sketching (Section 041 slides)Lesson 21: Curve Sketching (Section 041 slides)
Lesson 21: Curve Sketching (Section 041 slides)
 
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 15: Exponential Growth and Decay (Section 041 slides)
Lesson 15: Exponential Growth and Decay (Section 041 slides)Lesson 15: Exponential Growth and Decay (Section 041 slides)
Lesson 15: Exponential Growth and Decay (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 22: Optimization II (Section 041 slides)
 

More from 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
 

More from 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)
 

Recently uploaded

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
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Websitedgelyza
 
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesHow to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesThousandEyes
 
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdfJamie (Taka) Wang
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataSafe Software
 
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
 
Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.francesco barbera
 
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
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxGDSC PJATK
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioChristian Posta
 
RAG Patterns and Vector Search in Generative AI
RAG Patterns and Vector Search in Generative AIRAG Patterns and Vector Search in Generative AI
RAG Patterns and Vector Search in Generative AIUdaiappa Ramachandran
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostMatt Ray
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
Things you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceThings you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceMartin Humpolec
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
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
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Commit University
 
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
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaborationbruanjhuli
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 

Recently uploaded (20)

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
 
COMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a WebsiteCOMPUTER 10 Lesson 8 - Building a Website
COMPUTER 10 Lesson 8 - Building a Website
 
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyesHow to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
How to Effectively Monitor SD-WAN and SASE Environments with ThousandEyes
 
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
20200723_insight_release_plan_v6.pdf20200723_insight_release_plan_v6.pdf
 
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial DataCloud Revolution: Exploring the New Wave of Serverless Spatial Data
Cloud Revolution: Exploring the New Wave of Serverless Spatial Data
 
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.
 
Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.Digital magic. A small project for controlling smart light bulbs.
Digital magic. A small project for controlling smart light bulbs.
 
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
 
Cybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptxCybersecurity Workshop #1.pptx
Cybersecurity Workshop #1.pptx
 
Comparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and IstioComparing Sidecar-less Service Mesh from Cilium and Istio
Comparing Sidecar-less Service Mesh from Cilium and Istio
 
RAG Patterns and Vector Search in Generative AI
RAG Patterns and Vector Search in Generative AIRAG Patterns and Vector Search in Generative AI
RAG Patterns and Vector Search in Generative AI
 
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCostKubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
KubeConEU24-Monitoring Kubernetes and Cloud Spend with OpenCost
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
Things you didn't know you can use in your Salesforce
Things you didn't know you can use in your SalesforceThings you didn't know you can use in your Salesforce
Things you didn't know you can use in your Salesforce
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
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
 
Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)Crea il tuo assistente AI con lo Stregatto (open source python framework)
Crea il tuo assistente AI con lo Stregatto (open source python framework)
 
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
 
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online CollaborationCOMPUTER 10: Lesson 7 - File Storage and Online Collaboration
COMPUTER 10: Lesson 7 - File Storage and Online Collaboration
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 

Lesson 22: Optimization II (Section 041 slides)

  • 1. Section 4.5 Optimization II V63.0121.041, Calculus I New York University November 24, 2010 Announcements No recitation this week Quiz 5 on §§4.1–4.4 next week in recitation Happy Thanksgiving! . . . . . .
  • 2. . . . . . . Announcements No recitation this week Quiz 5 on §§4.1–4.4 next week in recitation Happy Thanksgiving! V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 2 / 25
  • 3. . . . . . . Objectives Given a problem requiring optimization, identify the objective functions, variables, and constraints. Solve optimization problems with calculus. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 3 / 25
  • 4. . . . . . . Outline Recall More examples Addition Distance Triangles Economics The Statue of Liberty V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 4 / 25
  • 5. . . . . . . Checklist for optimization problems 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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 5 / 25
  • 6. . . . . . . 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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 6 / 25
  • 7. . . . . . . Recall: The First Derivative Test See Section 4.3 Theorem (The First Derivative Test) Let f be continuous on (a, b) and c a critical point of f in (a, b). If f′ changes from negative to positive at c, then c is a local minimum. If f′ changes from positive to negative at c, then c is a local maximum. If f′ does not change sign at c, then c is not a local extremum. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 7 / 25
  • 8. . . . . . . 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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 7 / 25
  • 9. . . . . . . Recall: The Second Derivative Test See Section 4.3 Theorem (The Second Derivative Test) Let f, f′ , and f′′ be continuous on [a, b]. Let c be in (a, b) with f′ (c) = 0. If f′′ (c) < 0, then f(c) is a local maximum. If f′′ (c) > 0, then f(c) is a local minimum. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
  • 10. . . . . . . Recall: The Second Derivative Test See Section 4.3 Theorem (The Second Derivative Test) Let f, f′ , and f′′ be continuous on [a, b]. Let c be in (a, b) with f′ (c) = 0. If f′′ (c) < 0, then f(c) is a local maximum. If f′′ (c) > 0, then f(c) is a local minimum. Warning If f′′ (c) = 0, the second derivative test is inconclusive (this does not mean c is neither; we just don’t know yet). V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
  • 11. . . . . . . Recall: The Second Derivative Test See Section 4.3 Theorem (The Second Derivative Test) Let f, f′ , and f′′ be continuous on [a, b]. Let c be in (a, b) with f′ (c) = 0. If f′′ (c) < 0, then f(c) is a local maximum. If f′′ (c) > 0, then f(c) is a local minimum. Warning If f′′ (c) = 0, the second derivative test is inconclusive (this does not mean c is neither; we just don’t know yet). Corollary If f′ (c) = 0 and f′′ (x) > 0 for all x, then c is the global minimum of f If f′ (c) = 0 and f′′ (x) < 0 for all x, then c is the global maximum of f V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 8 / 25
  • 12. . . . . . . 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 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 9 / 25
  • 13. . . . . . . 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.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 9 / 25
  • 14. . . . . . . Outline Recall More examples Addition Distance Triangles Economics The Statue of Liberty V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 10 / 25
  • 15. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 16. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. Solution Objective: minimize S = x + y subject to the constraint that xy = 16 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 17. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. Solution Objective: minimize S = x + y subject to the constraint that xy = 16 Eliminate y: y = 16/x so S = x + 16/x. The domain of consideration is (0, ∞). V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 18. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. Solution Objective: minimize S = x + y subject to the constraint that xy = 16 Eliminate y: y = 16/x so S = x + 16/x. The domain of consideration is (0, ∞). Find the critical points: S′ (x) = 1 − 16/x2 , which is 0 when x = 4. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 19. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. Solution Objective: minimize S = x + y subject to the constraint that xy = 16 Eliminate y: y = 16/x so S = x + 16/x. The domain of consideration is (0, ∞). Find the critical points: S′ (x) = 1 − 16/x2 , which is 0 when x = 4. Classify the critical points: S′′ (x) = 32/x3 , which is always positive. So the graph is always concave up, 4 is a local min, and therefore the global min. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 20. . . . . . . Addition with a constraint Example Find two positive numbers x and y with xy = 16 and x + y as small as possible. Solution Objective: minimize S = x + y subject to the constraint that xy = 16 Eliminate y: y = 16/x so S = x + 16/x. The domain of consideration is (0, ∞). Find the critical points: S′ (x) = 1 − 16/x2 , which is 0 when x = 4. Classify the critical points: S′′ (x) = 32/x3 , which is always positive. So the graph is always concave up, 4 is a local min, and therefore the global min. So the numbers are x = y = 4, Smin = 8. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 11 / 25
  • 21. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
  • 22. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). Solution .. x. y .. (x, x2 ) .. 3 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
  • 23. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). Solution The distance between (x, x2 ) and (3, 0) is given by f(x) = √ (x − 3)2 + (x2 − 0)2 .. x. y .. (x, x2 ) .. 3 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
  • 24. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). Solution The distance between (x, x2 ) and (3, 0) is given by f(x) = √ (x − 3)2 + (x2 − 0)2 We may instead minimize the square of f: g(x) = f(x)2 = (x − 3)2 + x4 .. x. y .. (x, x2 ) .. 3 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
  • 25. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). Solution The distance between (x, x2 ) and (3, 0) is given by f(x) = √ (x − 3)2 + (x2 − 0)2 We may instead minimize the square of f: g(x) = f(x)2 = (x − 3)2 + x4 The domain is (−∞, ∞). .. x. y .. (x, x2 ) .. 3 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 12 / 25
  • 26. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 27. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . g′ (x) = 2(x − 3) + 4x3 = 4x3 + 2x − 6 = 2(2x3 + x − 3) V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 28. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . g′ (x) = 2(x − 3) + 4x3 = 4x3 + 2x − 6 = 2(2x3 + x − 3) If a polynomial has integer roots, they are factors of the constant term (Euler) V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 29. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . g′ (x) = 2(x − 3) + 4x3 = 4x3 + 2x − 6 = 2(2x3 + x − 3) If a polynomial has integer roots, they are factors of the constant term (Euler) 1 is a root, so 2x3 + x − 3 is divisible by x − 1: f′ (x) = 2(2x3 + x − 3) = 2(x − 1)(2x2 + 2x + 3) The quadratic has no real roots (the discriminant b2 − 4ac < 0) V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 30. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . g′ (x) = 2(x − 3) + 4x3 = 4x3 + 2x − 6 = 2(2x3 + x − 3) If a polynomial has integer roots, they are factors of the constant term (Euler) 1 is a root, so 2x3 + x − 3 is divisible by x − 1: f′ (x) = 2(2x3 + x − 3) = 2(x − 1)(2x2 + 2x + 3) The quadratic has no real roots (the discriminant b2 − 4ac < 0) We see f′ (1) = 0, f′ (x) < 0 if x < 1, and f′ (x) > 0 if x > 1. So 1 is the global minimum. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 31. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . g′ (x) = 2(x − 3) + 4x3 = 4x3 + 2x − 6 = 2(2x3 + x − 3) If a polynomial has integer roots, they are factors of the constant term (Euler) 1 is a root, so 2x3 + x − 3 is divisible by x − 1: f′ (x) = 2(2x3 + x − 3) = 2(x − 1)(2x2 + 2x + 3) The quadratic has no real roots (the discriminant b2 − 4ac < 0) We see f′ (1) = 0, f′ (x) < 0 if x < 1, and f′ (x) > 0 if x > 1. So 1 is the global minimum. The point on the parabola closest to (3, 0) is (1, 1). The minimum distance is √ 5. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 13 / 25
  • 32. . . . . . . Remark We’ve used each of the methods (CIM, 1DT, 2DT) so far. Notice how we argued that the critical points were absolute extremes even though 1DT and 2DT only tell you relative/local extremes. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 14 / 25
  • 33. . . . . . . A problem with a triangle .. Example Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two sides on legs of the triangle and one vertex on the hypotenuse. Solution .. 3 . 4 . 5 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
  • 34. . . . . . . A problem with a triangle .. Example Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two sides on legs of the triangle and one vertex on the hypotenuse. Solution Let the dimensions of the rectangle be x and y. .. 3 . 4 . 5 . y . x V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
  • 35. . . . . . . A problem with a triangle .. Example Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two sides on legs of the triangle and one vertex on the hypotenuse. Solution Let the dimensions of the rectangle be x and y. Similar triangles give y 3 − x = 4 3 =⇒ 3y = 4(3 − x) .. 3 . 4 . 5 . y . x V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
  • 36. . . . . . . A problem with a triangle .. Example Find the rectangle of maximal area inscribed in a 3-4-5 right triangle with two sides on legs of the triangle and one vertex on the hypotenuse. Solution Let the dimensions of the rectangle be x and y. Similar triangles give y 3 − x = 4 3 =⇒ 3y = 4(3 − x) So y = 4 − 4 3 x and A(x) = x ( 4 − 4 3 x ) = 4x− 4 3 x2 .. 3 . 4 . 5 . y . x V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 15 / 25
  • 37. . . . . . . Triangle Problem maximization step We want to find the absolute maximum of A(x) = 4x − 4 3 x2 on the interval [0, 3]. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
  • 38. . . . . . . Triangle Problem maximization step We want to find the absolute maximum of A(x) = 4x − 4 3 x2 on the interval [0, 3]. A(0) = A(3) = 0 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
  • 39. . . . . . . Triangle Problem maximization step We want to find the absolute maximum of A(x) = 4x − 4 3 x2 on the interval [0, 3]. A(0) = A(3) = 0 A′ (x) = 4 − 8 3 x, which is zero when x = 12 8 = 1.5. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
  • 40. . . . . . . Triangle Problem maximization step We want to find the absolute maximum of A(x) = 4x − 4 3 x2 on the interval [0, 3]. A(0) = A(3) = 0 A′ (x) = 4 − 8 3 x, which is zero when x = 12 8 = 1.5. Since A(1.5) = 3, this is the absolute maximum. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
  • 41. . . . . . . Triangle Problem maximization step We want to find the absolute maximum of A(x) = 4x − 4 3 x2 on the interval [0, 3]. A(0) = A(3) = 0 A′ (x) = 4 − 8 3 x, which is zero when x = 12 8 = 1.5. Since A(1.5) = 3, this is the absolute maximum. So the dimensions of the rectangle of maximal area are 1.5 × 2. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 16 / 25
  • 42. . . . . . . An Economics problem Example Let r be the monthly rent per unit in an apartment building with 100 units. A survey reveals that all units can be rented when r = 900 and that one unit becomes vacant with each 10 increase in rent. Suppose the average monthly maintenance costs per occupied unit is $100/month. What rent should be charged to maximize profit? V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 17 / 25
  • 43. . . . . . . An Economics problem Example Let r be the monthly rent per unit in an apartment building with 100 units. A survey reveals that all units can be rented when r = 900 and that one unit becomes vacant with each 10 increase in rent. Suppose the average monthly maintenance costs per occupied unit is $100/month. What rent should be charged to maximize profit? Solution Let n be the number of units rented, depending on price (the demand function). We have n(900) = 100 and ∆n ∆r = − 1 10 . So n − 100 = − 1 10 (r − 900) =⇒ n(r) = − 1 10 r + 190 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 17 / 25
  • 44. . . . . . . Economics Problem Finishing the model and maximizing The profit per unit rented is r − 100, so P(r) = (r − 100)n(r) = (r − 100) ( − 1 10 r + 190 ) = − 1 10 r2 + 200r − 19000 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
  • 45. . . . . . . Economics Problem Finishing the model and maximizing The profit per unit rented is r − 100, so P(r) = (r − 100)n(r) = (r − 100) ( − 1 10 r + 190 ) = − 1 10 r2 + 200r − 19000 We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?) V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
  • 46. . . . . . . Economics Problem Finishing the model and maximizing The profit per unit rented is r − 100, so P(r) = (r − 100)n(r) = (r − 100) ( − 1 10 r + 190 ) = − 1 10 r2 + 200r − 19000 We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?) A(900) = $800 × 100 = $80, 000, A(1900) = 0 V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
  • 47. . . . . . . Economics Problem Finishing the model and maximizing The profit per unit rented is r − 100, so P(r) = (r − 100)n(r) = (r − 100) ( − 1 10 r + 190 ) = − 1 10 r2 + 200r − 19000 We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?) A(900) = $800 × 100 = $80, 000, A(1900) = 0 A′ (x) = − 1 5 r + 200, which is zero when r = 1000. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
  • 48. . . . . . . Economics Problem Finishing the model and maximizing The profit per unit rented is r − 100, so P(r) = (r − 100)n(r) = (r − 100) ( − 1 10 r + 190 ) = − 1 10 r2 + 200r − 19000 We want to maximize P on the interval 900 ≤ r ≤ 1900. (Why?) A(900) = $800 × 100 = $80, 000, A(1900) = 0 A′ (x) = − 1 5 r + 200, which is zero when r = 1000. n(1000) = 90, so P(r) = $900 × 90 = $81, 000. This is the maximum intake. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 18 / 25
  • 49. . . . . . . The Statue of Liberty Example The Statue of Liberty stands on top of a pedestal which is on top of on old fort. The top of the pedestal is 47 m above ground level. The statue itself measures 46 m from the top of the pedestal to the tip of the torch. What distance should one stand away from the statue in order to maximize the view of the statue? That is, what distance will maximize the portion of the viewer’s vision taken up by the statue? V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 19 / 25
  • 50. . . . . . . The Statue of Liberty Seting up the model Solution The angle subtended by the statue in the viewer’s eye can be expressed as θ = arctan ( a + b x ) −arctan ( b x ) . a b θ x The domain of θ is all positive real numbers x. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 20 / 25
  • 51. . . . . . . The Statue of Liberty Finding the derivative θ = arctan ( a + b x ) − arctan ( b x ) So dθ dx = 1 1 + ( a+b x )2 · −(a + b) x2 − 1 1 + ( b x )2 · −b x2 = b x2 + b2 − a + b x2 + (a + b)2 = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] (x2 + b2 ) [ x2 + (a + b)2 ] V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 21 / 25
  • 52. . . . . . . The Statue of Liberty Finding the critical points dθ dx = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] (x2 + b2 ) [ x2 + (a + b)2 ] V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
  • 53. . . . . . . The Statue of Liberty Finding the critical points dθ dx = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] (x2 + b2 ) [ x2 + (a + b)2 ] This derivative is zero if and only if the numerator is zero, so we seek x such that 0 = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] = a(ab + b2 − x2 ) V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
  • 54. . . . . . . The Statue of Liberty Finding the critical points dθ dx = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] (x2 + b2 ) [ x2 + (a + b)2 ] This derivative is zero if and only if the numerator is zero, so we seek x such that 0 = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] = a(ab + b2 − x2 ) The only positive solution is x = √ b(a + b). V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
  • 55. . . . . . . The Statue of Liberty Finding the critical points dθ dx = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] (x2 + b2 ) [ x2 + (a + b)2 ] This derivative is zero if and only if the numerator is zero, so we seek x such that 0 = [ x2 + (a + b)2 ] b − (a + b) [ x2 + b2 ] = a(ab + b2 − x2 ) The only positive solution is x = √ b(a + b). Using the first derivative test, we see that dθ/dx > 0 if 0 < x < √ b(a + b) and dθ/dx < 0 if x > √ b(a + b). So this is definitely the absolute maximum on (0, ∞). V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 22 / 25
  • 56. . . . . . . The Statue of Liberty Final answer If we substitute in the numerical dimensions given, we have x = √ (46)(93) ≈ 66.1 meters This distance would put you pretty close to the front of the old fort which lies at the base of the island. Unfortunately, you’re not allowed to walk on this part of the lawn. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 23 / 25
  • 57. . . . . . . The Statue of Liberty Discussion The length √ b(a + b) is the geometric mean of the two distances measured from the ground—to the top of the pedestal (a) and the top of the statue (a + b). The geometric mean is of two numbers is always between them and greater than or equal to their average. V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 24 / 25
  • 58. . . . . . . Summary Remember the checklist Ask yourself: what is the objective? Remember your geometry: similar triangles right triangles trigonometric functions Name [_ Problem Solving Strategy Draw a Picture Kathy had a box of 8 crayons. She gave some crayons away. She has 5 left. How many crayons did Kathy give away? UNDERSTAND • What do you want to find out? Draw a line under the question. You can draw a picture to solve the problem. crayons What number do I add to 5 to get 8? 8 - = 5 5 + 3 = 8 CHECK Does your answer make sense? Explain. Draw a picture to solve the problem. Write how many were given away. I. I had10 pencils. I gave some away. I have 3left. How many pencils did I give away? ~7 What number do I add to 3 to make 10? 13 i ft ill :i i ? 11 ft I '•' « I I ft A H 11 M i l U U U U> U U I I V63.0121.041, Calculus I (NYU) Section 4.5 Optimization II November 24, 2010 25 / 25