optimatization - maximum/minimum problems – bc

1
OPTIMATIZATION - MAXIMUM/MINIMUM PROBLEMS – BC CALCULUS
1. Read each problem slowly and carefully. Read the problem at least three times before trying to solve it.
Sometimes words can be ambiguous. It is imperative to know exactly what the problem is asking. If you
misread the problem or hurry through it, you have NO chance of solving it correctly.
2. If appropriate, draw a sketch or diagram of the problem to be solved. Pictures are a great help in
organizing and sorting out your thoughts.
3. Define variables to be used and carefully label your picture or diagram with these variables. This step is
very important because it leads directly or indirectly to the creation of mathematical equations.
4. Write down all equations which are related to your problem or diagram. Experience will show you that
MOST optimization problems will begin with two equations. One equation is a "constraint" equation and
the other is the "optimization" equation – the one you are asked to maximize or minimize. The
"constraint" equation is used to solve for one of the variables. This is then substituted into the
"optimization" equation before differentiation occurs. Some problems may have NO constraint equation.
Some problems may have two or more constraint equations.
5. Before differentiating, make sure that the optimization equation is a function of only one variable. Then
differentiate using the well-known rules of differentiation.
Example 1:
Two positive numbers have a sum of 60. What is the maximum product of one number times the
square of the second number?
Constraint eq.
Optimization eq.
π‘Ž + 𝑏 = 60
𝑃 = π‘Ž2 𝑏
π‘ƒπ‘šπ‘Žπ‘₯ =?
𝑃 = π‘Ž2 𝑏 = π‘Ž2 (60 βˆ’ π‘Ž) = 60π‘Ž2 βˆ’ π‘Ž3
𝑑𝑃
= 120π‘Ž βˆ’ 3π‘Ž2 = 0 β‡’ π‘Ž(40 βˆ’ π‘Ž) = 0
π‘‘π‘Ž
π‘Ž = 0 𝑃 = 0 π‘šπ‘–π‘›π‘–π‘šπ‘’π‘š
π‘Ž = 40 𝑏 = 20 π‘ƒπ‘šπ‘Žπ‘₯ = 32000
Example 2:
We need to enclose a portion of a field with a rectangular fence. We have 500 feet of fencing
material and a building is on one of the longer sides of the field and so won’t need any fencing.
Determine the dimensions of the field that will enclose the largest area.
Constraint eq.
π‘Ž + 2𝑏 = 500
Optimization eq.
𝐴 = π‘Žπ‘
π΄π‘šπ‘Žπ‘₯ =?
𝐴 = π‘Žπ‘ = (500 βˆ’ 2𝑏)𝑏 = 500𝑏 βˆ’ 2𝑏 2
𝑑𝐴
= 500 βˆ’ 4𝑏 = 0 β‡’ 𝑏 = 125 π‘Ž = 250
π‘‘π‘Ž
π΄π‘šπ‘Žπ‘₯ = 31250
2
Example 3:
We need to enclose a portion of a field with a rectangular fence that has two pens of equal area and
equal size. We want to enclose at total of 10,000 square feet. Determine the least amount of fencing
we will need.
Constraint eq.
Optimization eq.
𝐴 = 2π‘Žπ‘ = 10000
𝑃 = 3𝑏 + 4π‘Ž
π‘ƒπ‘šπ‘–π‘› =?
𝑃 = 3𝑏 + 4π‘Ž = 15000/π‘Ž + 4π‘Ž
𝑑𝑃
15000
=βˆ’
+ 4 = 0 β‡’ π‘Ž = 61.237 𝑏 = 81.650
π‘Ž2
π‘‘π‘Ž
π‘ƒπ‘šπ‘–π‘› = 489.884 𝑓𝑒𝑒𝑑
Example 4:
We need to enclose a portion of a field with a rectangular fence. A river is on one side of the
fence, so we won’t need to fence along the river. We would like to enclose 10,000 square feet.
Because of the added construction costs of building perpendicular to the river, it costs $8 a liner
foot to buy and build the fence. The portion of the fence parallel to the river only cost $5 per liner
foot to buy and build. What is the least amount of money we will need to construct our fence?
Constraint eq.
π‘Žπ‘ = 10000
Optimization eq.
𝑀 = 2 × 8𝑏 + 5π‘Ž
π‘€π‘šπ‘–π‘› =?
𝑀 = 16𝑏 + 5π‘Ž = 16𝑏 + 50000/𝑏
50000
𝑑𝑀
= 16 βˆ’
= 0 β‡’ 𝑏 = 55.902 π‘Ž = 178.885
𝑑𝑏
𝑏2
π‘€π‘šπ‘–π‘› = $1789.147
Example 5:
We want to construct a box with a square base and we only have 10 square meters of material to use
in construction of the box. Assuming that all the material is used in the construction process
determine the maximum volume that the box can have.
Constraint eq.
2π‘Ž2 + 4π‘Žπ‘ = 10
Optimization eq.
𝑉 = π‘Ž2 𝑏
π‘‰π‘šπ‘Žπ‘₯ =?
5 π‘Ž
5π‘Ž
𝑉 = π‘Ž2 𝑏 = π‘Ž2 οΏ½ βˆ’ οΏ½ =
βˆ’ π‘Ž3 /2
2π‘Ž 2
2
𝑑𝑉 5 3π‘Ž2
5
= βˆ’
=0 β‡’π‘Ž=οΏ½
π‘‘π‘Ž 2
2
3
π‘‰π‘šπ‘Žπ‘₯ = π‘Ž3 =
5 5
οΏ½
3 3
5
𝑏=οΏ½
3
3
Example 6:
A cylindrical aluminum soda can is to hold 12 ounces of tasty beverage. What are the dimensions of
the can that will minimize the amount of aluminum used? Hint:
12 US fluid ounces equals 21.6562 cubic inches. If the dimensions of the actual can are 2.6 inch
diameter and 4.75 inches tall, does the actual can have the optimal dimensions?
Constraint eq.
Optimization eq.
(πœ‹π‘Ÿ 2 )β„Ž = 21.6562
𝐴 = (2πœ‹π‘Ÿ)β„Ž + 2(πœ‹π‘Ÿ 2 )
π΄π‘šπ‘–π‘› =?
𝐴 = (2πœ‹π‘Ÿ)β„Ž + 2(πœ‹π‘Ÿ 2 ) = 2πœ‹π‘Ÿ
43.3124
𝑑𝐴
=βˆ’
+ 4πœ‹π‘Ÿ
π‘Ÿ2
π‘‘π‘Ž
STRANGE ???
21.6562
43.3124
+ 2πœ‹π‘Ÿ 2 =
+ 2πœ‹π‘Ÿ 2
2
πœ‹π‘Ÿ
π‘Ÿ
π‘Ÿ = 1.511" β„Ž = 15.664"
π΄π‘šπ‘–π‘› = 163.057 π‘–π‘›π‘β„Žπ‘’π‘  3
Sometimes we also want to maximize CLOSENESS!
Example 7:
Determine the point(s) on 𝑦 = π‘₯ 2 + 1 that are closest to (0,2).
π‘ƒπ‘œπ‘–π‘›π‘‘π‘  (π‘₯, 𝑦)π‘Žπ‘›π‘‘ (0,2)
Constraint eq.
𝑦 = π‘₯2 + 1
Optimization eq.
𝑑 = οΏ½(π‘₯ βˆ’ 0)2 + (π‘₯ 2 + 1 βˆ’ 2)2
𝑑 = οΏ½π‘₯ 4 βˆ’ π‘₯ 2 + 1
𝑑𝑑
4π‘₯ 3 βˆ’ 2π‘₯
=
=0
𝑑π‘₯
2√π‘₯ 4 βˆ’ π‘₯ 2 + 1
π‘“π‘œπ‘Ÿ π‘₯ = 0, 𝑑 = 1
β‡’ π‘‘π‘šπ‘–π‘› =
√3
2
π‘‘π‘šπ‘–π‘› =?
β‡’ 2π‘₯(π‘₯ 2 βˆ’ 1)
π‘“π‘œπ‘Ÿ π‘₯ = ±
√2
2
,𝑑 =
√3
2
π‘₯=0
√2 3
√2 3
π‘“π‘œπ‘Ÿ οΏ½ , οΏ½ π‘Žπ‘›π‘‘ οΏ½βˆ’
, οΏ½
2 2
2 2
π‘₯=±
√2
2
4
At this point, you might be tempted to think that the optimal value is always at the
critical value. HA HA HA
Example 8:
A 2 feet piece of wire is cut into two pieces and once piece is bent into a square and the other is bent
into an equilateral triangle. Where should the wire cut so that the total area enclosed by both is a (a)
minimum and (b) maximum? (Note: it is not required to build both shapes).
Let’s cut the wire into two pieces. The first piece will have length x which we’ll bend into a square and each
π‘₯
4
side will have length . The second piece will then have length (2 βˆ’ π‘₯)(constraint) and we’ll bend this into
an equilateral triangle and each side will have length
1
(2 βˆ’
3
π‘₯).
Optimization eq.
π‘₯ 2 1 1
π‘₯ 2 √3
√3
𝐴(π‘₯) = οΏ½ οΏ½ + οΏ½ (2 βˆ’ π‘₯)οΏ½ οΏ½ (2 βˆ’ π‘₯)οΏ½ =
+
(2 βˆ’ π‘₯)2
6
16 36
4
2 3
π΄π‘šπ‘Žπ‘₯ =?
𝑑𝐴 π‘₯ √3
8√3
π‘₯ √3
√3
(2)(2 βˆ’ π‘₯)(βˆ’1) = +
= +
π‘₯βˆ’
=0 β‡’ π‘₯=
= 0.8699
9
𝑑π‘₯ 8 36
8 18
9 + 4√3
π΄π‘šπ‘–π‘› =?
Now, let’s notice that the problem statement asked for both the minimum and maximum enclosed
area and we got a single critical point. BUT:
Let’s notice that x must be in the range 0 ≀ π‘₯ ≀ 2 and since the area function is continuous we use
the basic process for finding absolute extrema of a function.
𝐴(0) = 0.1925
𝐴(0.8699) = 0.1087
𝐴(2) = 0.25
So, it looks like the minimum area will arise if we take π‘₯ = 0.8699 while the maximum area will
arise if we take the whole piece of wire and bend it into a square.
One of the extrema in the previous problem was at an endpoint and that will happen on occasion.
5
Sometimes we need to establish a pattern to write our primary equation (Examples 8 & 9).
Example 9:
The manager of an 80-unit apartment complex is trying to decide what rent to charge. Experience
has shown that at a rent of $200, all of the units will be full. On the average, one additional unit will
remain vacant for each $20 increase in rent. Find the rent to charge so as to maximize revenue.
a pattern:
a) π‘₯ = the number of $20 increases. The rent for an apartment is 200 + 20π‘₯
b) number of apartments rented:
For each $20 increase, one less apartment will be rented. Since π‘₯ is the number of 20 increases,
the number of vacancies will be π‘₯, and the number of apartments rented will be
80 βˆ’ π‘₯
Optimization eq.
the total revenue from all rented apartments:
𝑅 = (80 βˆ’ π‘₯)(200 + 20π‘₯) = 16000 + 1400π‘₯ βˆ’ 20π‘₯ 2
𝑑𝑅
= 1400 βˆ’ 40π‘₯ = 0
𝑑π‘₯
β‡’
π‘₯ = 35
π‘…π‘šπ‘Žπ‘₯ =?
Rent for an apartment would be $900 (π‘£π‘’π‘Ÿπ‘¦ 𝑒π‘₯𝑝𝑒𝑛𝑠𝑖𝑣𝑒), 45 π‘Ÿπ‘’π‘›π‘‘π‘’π‘‘ π‘Žπ‘›π‘‘ 𝑅 = $40500
Example 10:
A fence, 8 feet high, is parallel to the wall of a building and 1 foot
from the building. What is the shortest plank that can go over the
fence, from the level ground, to prop the wall?
Constraint eq.
sin πœƒ =
8
π‘₯
1
𝑦
8
1
=
+
sin πœƒ cos πœƒ
cos πœƒ =
Optimization eq.
𝐿 =π‘₯+𝑦
0<πœƒ<
πœ‹
2
𝑑𝐿 βˆ’8 cos πœƒ sin πœƒ
=
+
= 0 β‡’ βˆ’8π‘π‘œπ‘  3 πœƒ + 𝑠𝑖𝑛3 πœƒ = 0
π‘‘πœƒ
𝑠𝑖𝑛2 πœƒ
π‘π‘œπ‘  2 πœƒ
π‘‘π‘Žπ‘›3 πœƒ = 8 β‡’ π‘‘π‘Žπ‘› πœƒ = 2 β‡’ πœƒ = 63.4π‘œ β‰ˆ 1.1
𝑑𝐿
π‘‘πœƒ
πœƒ
0
βˆ’
1.1
+
πœ‹
2
6
πœ‹
οΏ½0, οΏ½ 𝑖𝑠 π‘œπ‘π‘’π‘› π‘–π‘›π‘‘π‘’π‘Ÿπ‘£π‘Žπ‘™, π‘ π‘œ 𝐿 β„Žπ‘Žπ‘  π‘™π‘œπ‘π‘Žπ‘™ π‘Žπ‘›π‘‘ π‘Žπ‘π‘ π‘œπ‘™π‘’π‘‘π‘’ π‘šπ‘–π‘›π‘–π‘šπ‘’π‘š π‘œπ‘›π‘™π‘¦ π‘Žπ‘‘ πœƒ = 1.1
2
π‘₯ = οΏ½82 + οΏ½
8 2
1
� = 8�1 + = 4√5
tan πœƒ
4
𝑦 = οΏ½12 + (1 × tan πœƒ)2 = √1 + 4 = √5
𝐿 = π‘₯ + 𝑦 = 5√5𝑓𝑑 β‰ˆ 11.2𝑓𝑑
It’s fun to inscribe shapes into other shapes that circumscribe the inscribed shape we’re inscribing.
Example 11:
Find the volume of the largest cone that can be inscribed inside a sphere of
radius 5.
Constraint eq.
Optimization eq.
(β„Ž βˆ’ 𝑅)2 + π‘Ÿ2 = 𝑅2
𝑉 = 1/3 πœ‹ π‘Ÿ2 β„Ž
1
1
𝑉 = πœ‹ [𝑅 2 βˆ’ (β„Ž βˆ’ 𝑅)2 ]β„Ž = πœ‹ [2π‘…β„Ž2 βˆ’ β„Ž3 ]
3
3
𝑑𝑉 1
= πœ‹[4π‘…β„Ž βˆ’ 3β„Ž2 ] = 0
π‘‘β„Ž 3
32
π‘‰π‘šπ‘Žπ‘₯ = 81 πœ‹π‘… 3
β‡’ β„Ž = 0 (π‘šπ‘–π‘›)
β„Ž=
4
𝑅 (π‘šπ‘Žπ‘₯)
3
Example 12:
An arch top window is being built whose bottom is a rectangle and the top is a semicircle.
If there is 12 meters of framing materials what is the width of the window that lets in
the most light?
Constraint eq.
2β„Ž + 2π‘Ÿ + πœ‹π‘Ÿ = 12
Optimization eq.
1
𝐴 = 2β„Žπ‘Ÿ + πœ‹π‘Ÿ 2
2
1
1
1
𝐴(π‘Ÿ) = 2π‘Ÿ οΏ½6 βˆ’ π‘Ÿ βˆ’ πœ‹π‘ŸοΏ½ + πœ‹π‘Ÿ 2 = 12π‘Ÿ βˆ’ 2π‘Ÿ 2 βˆ’ πœ‹π‘Ÿ 2
2
2
2
𝑑𝐴
= 12 βˆ’ π‘Ÿ(4 + πœ‹) = 0
π‘‘π‘Ÿ
𝑑2𝐴
= βˆ’4 βˆ’ πœ‹ < 0
π‘‘π‘Ÿ 2
β‡’
π‘Ÿ=
12
= 1.6803
4+πœ‹
π΄π‘šπ‘Žπ‘₯ π‘šπ‘’π‘ π‘‘ β„Žπ‘Žπ‘£π‘’ π‘ π‘’π‘šπ‘–π‘π‘–π‘Ÿπ‘π‘™π‘’ π‘Ÿ = 1.6803 π‘Žπ‘›π‘‘ π‘Ÿπ‘’π‘π‘‘π‘Žπ‘›π‘”π‘™π‘’ 3.3606 × 1.6803(β„Ž × 2π‘Ÿ)