SlideShare a Scribd company logo
Section 4.5
Optimization II
V63.0121.021, Calculus I
New York University
class supplement
Announcements
Quiz 5 on §§4.1–4.4 next week in recitation
Happy Thanksgiving!
. . . . . .
. . . . . .
Announcements
Quiz 5 on §§4.1–4.4 next
week in recitation
Happy Thanksgiving!
V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 2 / 25
. . . . . .
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.5 Optimization II class supplement 3 / 25
. . . . . .
Outline
Recall
More examples
Addition
Distance
Triangles
Economics
The Statue of Liberty
V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 9 / 25
. . . . . .
Outline
Recall
More examples
Addition
Distance
Triangles
Economics
The Statue of Liberty
V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 11 / 25
. . . . . .
Distance
Example
Find the point P on the parabola y = x2
closest to the point (3, 0).
V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 12 / 25
. . . . . .
Distance problem
minimization step
We want to find the global minimum of g(x) = (x − 3)2
+ x4
.
V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 25 / 25

More Related Content

What's hot

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)
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
 
Developing Expert Voices
Developing Expert VoicesDeveloping Expert Voices
Developing Expert VoicesbL__ah
 
Permutations and Combinations IIT JEE+Olympiad Lecture 4
Permutations and Combinations IIT JEE+Olympiad Lecture 4Permutations and Combinations IIT JEE+Olympiad Lecture 4
Permutations and Combinations IIT JEE+Olympiad Lecture 4
Parth Nandedkar
 
Lesson 21: Curve Sketching
Lesson 21: Curve SketchingLesson 21: Curve Sketching
Lesson 21: Curve SketchingMatthew Leingang
 
Formulae GCSE Mathematics
Formulae GCSE MathematicsFormulae GCSE Mathematics
Formulae GCSE Mathematics
Colleen Young
 
Class X Mathematics Study Material
Class X Mathematics Study MaterialClass X Mathematics Study Material
Class X Mathematics Study Material
FellowBuddy.com
 
Solving Problems Involving Radicals
Solving Problems Involving RadicalsSolving Problems Involving Radicals
Solving Problems Involving Radicals
Cipriano De Leon
 
3 graphs of second degree functions x
3 graphs of second degree functions x3 graphs of second degree functions x
3 graphs of second degree functions x
Tzenma
 
Year 13 challenge mathematics problems 107
Year 13 challenge mathematics problems 107Year 13 challenge mathematics problems 107
Year 13 challenge mathematics problems 107
Dennis Almeida
 
Lesson 19: Curve Sketching
Lesson 19: Curve SketchingLesson 19: Curve Sketching
Lesson 19: Curve SketchingMatthew Leingang
 
Kuiz Add Maths
Kuiz Add MathsKuiz Add Maths
Kuiz Add Mathsmorabisma
 
Computer Oriented Numerical Methods Practical File
Computer Oriented Numerical Methods Practical FileComputer Oriented Numerical Methods Practical File
Computer Oriented Numerical Methods Practical File
Harjinder Singh
 
F4 10 Angles Of Elevation Dep
F4 10 Angles Of Elevation   DepF4 10 Angles Of Elevation   Dep
F4 10 Angles Of Elevation Depguestcc333c
 
Appendex d
Appendex dAppendex d
Appendex dswavicky
 
Appendex c
Appendex cAppendex c
Appendex cswavicky
 

What's hot (19)

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)
 
Engr 371 final exam april 1996
Engr 371 final exam april 1996Engr 371 final exam april 1996
Engr 371 final exam april 1996
 
Limit
LimitLimit
Limit
 
DEV
DEVDEV
DEV
 
Developing Expert Voices
Developing Expert VoicesDeveloping Expert Voices
Developing Expert Voices
 
Permutations and Combinations IIT JEE+Olympiad Lecture 4
Permutations and Combinations IIT JEE+Olympiad Lecture 4Permutations and Combinations IIT JEE+Olympiad Lecture 4
Permutations and Combinations IIT JEE+Olympiad Lecture 4
 
Lesson 21: Curve Sketching
Lesson 21: Curve SketchingLesson 21: Curve Sketching
Lesson 21: Curve Sketching
 
Formulae GCSE Mathematics
Formulae GCSE MathematicsFormulae GCSE Mathematics
Formulae GCSE Mathematics
 
Class X Mathematics Study Material
Class X Mathematics Study MaterialClass X Mathematics Study Material
Class X Mathematics Study Material
 
Solving Problems Involving Radicals
Solving Problems Involving RadicalsSolving Problems Involving Radicals
Solving Problems Involving Radicals
 
Aieee Mathematics 2006
Aieee Mathematics   2006Aieee Mathematics   2006
Aieee Mathematics 2006
 
3 graphs of second degree functions x
3 graphs of second degree functions x3 graphs of second degree functions x
3 graphs of second degree functions x
 
Year 13 challenge mathematics problems 107
Year 13 challenge mathematics problems 107Year 13 challenge mathematics problems 107
Year 13 challenge mathematics problems 107
 
Lesson 19: Curve Sketching
Lesson 19: Curve SketchingLesson 19: Curve Sketching
Lesson 19: Curve Sketching
 
Kuiz Add Maths
Kuiz Add MathsKuiz Add Maths
Kuiz Add Maths
 
Computer Oriented Numerical Methods Practical File
Computer Oriented Numerical Methods Practical FileComputer Oriented Numerical Methods Practical File
Computer Oriented Numerical Methods Practical File
 
F4 10 Angles Of Elevation Dep
F4 10 Angles Of Elevation   DepF4 10 Angles Of Elevation   Dep
F4 10 Angles Of Elevation Dep
 
Appendex d
Appendex dAppendex d
Appendex d
 
Appendex c
Appendex cAppendex c
Appendex c
 

Viewers also liked

Signal Processing Course : Theory for Sparse Recovery
Signal Processing Course : Theory for Sparse RecoverySignal Processing Course : Theory for Sparse Recovery
Signal Processing Course : Theory for Sparse Recovery
Gabriel Peyré
 
Compressed Sensing In Spectral Imaging
Compressed Sensing In Spectral Imaging  Compressed Sensing In Spectral Imaging
Compressed Sensing In Spectral Imaging
Distinguished Lecturer Series - Leon The Mathematician
 
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
 
Signal Processing Course : Convex Optimization
Signal Processing Course : Convex OptimizationSignal Processing Course : Convex Optimization
Signal Processing Course : Convex Optimization
Gabriel Peyré
 
Recovering Lost Sensor Data through Compressed Sensing
Recovering Lost Sensor Data through Compressed SensingRecovering Lost Sensor Data through Compressed Sensing
Recovering Lost Sensor Data through Compressed Sensing
Zainul Charbiwala
 
Aggregat planning stevenson
Aggregat planning stevensonAggregat planning stevenson
Aggregat planning stevensonPiyush Vanjani
 
Optimizing Sterile Processing Workflow
Optimizing Sterile Processing WorkflowOptimizing Sterile Processing Workflow
Optimizing Sterile Processing Workflowdpjphx
 
Introduction to optimization Problems
Introduction to optimization ProblemsIntroduction to optimization Problems
ITIL Practical Guide - Service Operation
ITIL Practical Guide - Service OperationITIL Practical Guide - Service Operation
ITIL Practical Guide - Service Operation
Axios Systems
 
Functions in Service Operation
Functions in Service OperationFunctions in Service Operation
Functions in Service Operationnuwulang
 
Continuous process improvement (4)
Continuous process improvement (4)Continuous process improvement (4)
Continuous process improvement (4)
083805154
 
Service Operation Processes
Service Operation ProcessesService Operation Processes
Service Operation Processesnuwulang
 

Viewers also liked (13)

Signal Processing Course : Theory for Sparse Recovery
Signal Processing Course : Theory for Sparse RecoverySignal Processing Course : Theory for Sparse Recovery
Signal Processing Course : Theory for Sparse Recovery
 
Compressed Sensing In Spectral Imaging
Compressed Sensing In Spectral Imaging  Compressed Sensing In Spectral Imaging
Compressed Sensing In Spectral Imaging
 
Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)Lesson 22: Optimization (Section 021 slides)
Lesson 22: Optimization (Section 021 slides)
 
Signal Processing Course : Convex Optimization
Signal Processing Course : Convex OptimizationSignal Processing Course : Convex Optimization
Signal Processing Course : Convex Optimization
 
Recovering Lost Sensor Data through Compressed Sensing
Recovering Lost Sensor Data through Compressed SensingRecovering Lost Sensor Data through Compressed Sensing
Recovering Lost Sensor Data through Compressed Sensing
 
Aggregat planning stevenson
Aggregat planning stevensonAggregat planning stevenson
Aggregat planning stevenson
 
Optimizing Sterile Processing Workflow
Optimizing Sterile Processing WorkflowOptimizing Sterile Processing Workflow
Optimizing Sterile Processing Workflow
 
Introduction to optimization Problems
Introduction to optimization ProblemsIntroduction to optimization Problems
Introduction to optimization Problems
 
ITIL Practical Guide - Service Operation
ITIL Practical Guide - Service OperationITIL Practical Guide - Service Operation
ITIL Practical Guide - Service Operation
 
Functions in Service Operation
Functions in Service OperationFunctions in Service Operation
Functions in Service Operation
 
Continuous process improvement (4)
Continuous process improvement (4)Continuous process improvement (4)
Continuous process improvement (4)
 
IEEE Presentation
IEEE PresentationIEEE Presentation
IEEE Presentation
 
Service Operation Processes
Service Operation ProcessesService Operation Processes
Service Operation Processes
 

Similar to Lesson 22: Optimization II (Section 021 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)
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 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 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 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 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 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 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 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 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)
Matthew Leingang
 
AppsDiff3c.pdf
AppsDiff3c.pdfAppsDiff3c.pdf
AppsDiff3c.pdf
AkashKumar616744
 
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 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
 
STA003_WK4_L.pptx
STA003_WK4_L.pptxSTA003_WK4_L.pptx
STA003_WK4_L.pptx
MAmir23
 
Derivatives in graphing-dfs
Derivatives in graphing-dfsDerivatives in graphing-dfs
Derivatives in graphing-dfs
Farhana Shaheen
 
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptxECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
MdJubayerFaisalEmon
 
Twinkle
TwinkleTwinkle
Twinkle
jabi khan
 
Department of MathematicsMTL107 Numerical Methods and Com.docx
Department of MathematicsMTL107 Numerical Methods and Com.docxDepartment of MathematicsMTL107 Numerical Methods and Com.docx
Department of MathematicsMTL107 Numerical Methods and Com.docx
salmonpybus
 

Similar to Lesson 22: Optimization II (Section 021 slides) (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 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 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 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 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 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)Lesson 22: Optimization (Section 041 slides)
Lesson 22: Optimization (Section 041 slides)
 
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 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 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 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)Lesson 23: Antiderivatives (Section 041 handout)
Lesson 23: Antiderivatives (Section 041 handout)
 
AppsDiff3c.pdf
AppsDiff3c.pdfAppsDiff3c.pdf
AppsDiff3c.pdf
 
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 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)
 
STA003_WK4_L.pptx
STA003_WK4_L.pptxSTA003_WK4_L.pptx
STA003_WK4_L.pptx
 
Derivatives in graphing-dfs
Derivatives in graphing-dfsDerivatives in graphing-dfs
Derivatives in graphing-dfs
 
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptxECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
ECE 2103_L6 Boolean Algebra Canonical Forms [Autosaved].pptx
 
Twinkle
TwinkleTwinkle
Twinkle
 
Department of MathematicsMTL107 Numerical Methods and Com.docx
Department of MathematicsMTL107 Numerical Methods and Com.docxDepartment of MathematicsMTL107 Numerical Methods and Com.docx
Department of MathematicsMTL107 Numerical Methods and Com.docx
 

More from Matthew Leingang

Making Lesson Plans
Making Lesson PlansMaking Lesson Plans
Making Lesson Plans
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-choice
Matthew Leingang
 
Electronic Grading of Paper Assessments
Electronic Grading of Paper AssessmentsElectronic Grading of Paper Assessments
Electronic Grading of Paper Assessments
Matthew 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)
 

Lesson 22: Optimization II (Section 021 slides)

  • 1. Section 4.5 Optimization II V63.0121.021, Calculus I New York University class supplement Announcements Quiz 5 on §§4.1–4.4 next week in recitation Happy Thanksgiving! . . . . . .
  • 2. . . . . . . Announcements Quiz 5 on §§4.1–4.4 next week in recitation Happy Thanksgiving! V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 2 / 25
  • 3. . . . . . . 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.5 Optimization II class supplement 3 / 25
  • 4. . . . . . . Outline Recall More examples Addition Distance Triangles Economics The Statue of Liberty V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 9 / 25
  • 14. . . . . . . Outline Recall More examples Addition Distance Triangles Economics The Statue of Liberty V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 11 / 25
  • 21. . . . . . . Distance Example Find the point P on the parabola y = x2 closest to the point (3, 0). V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 12 / 25
  • 26. . . . . . . Distance problem minimization step We want to find the global minimum of g(x) = (x − 3)2 + x4 . V63.0121.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 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.021, Calculus I (NYU) Section 4.5 Optimization II class supplement 25 / 25