Homework 8 [10/21/08]: Solutions [2.6:4] (a) if x is the quantity per

Homework 8 [10/21/08]: Solutions
[2.6:4] (a) if x is the quantity per order and r is the number of orders placed during the year, then the
πΌπ‘›π‘£π‘’π‘›π‘‘π‘œπ‘Ÿπ‘¦ πΆπ‘œπ‘ π‘‘ = 𝐼𝐢 = π‘œπ‘Ÿπ‘‘π‘’π‘Ÿπ‘–π‘›π‘” π‘π‘œπ‘ π‘‘ + π‘π‘Žπ‘Ÿπ‘Ÿπ‘¦π‘–π‘›π‘” π‘π‘œπ‘ π‘‘ = 160π‘Ÿ + 16π‘₯
𝑒𝑛𝑖𝑑𝑠
(b) The constraint function can be modeled by π‘₯ π‘œπ‘Ÿπ‘‘π‘’π‘Ÿ βˆ™ π‘Ÿ π‘œπ‘Ÿπ‘‘π‘’π‘Ÿπ‘  = π‘₯π‘Ÿ 𝑒𝑛𝑖𝑑𝑠 = 640 𝑒𝑛𝑖𝑑𝑠
(c) Minimize Inventory Cost :
𝐼𝐢 = 160π‘Ÿ + 16π‘₯ = 160π‘Ÿ + 16
640
π‘Ÿ
= 106π‘Ÿ + 16 640 π‘Ÿ βˆ’1
𝐼𝐢 β€² π‘Ÿ = 160 βˆ’ 16 640 π‘Ÿ βˆ’2 = 160 1 βˆ’ 64π‘Ÿ βˆ’2
To minimize, set 𝐼𝐢 β€² π‘Ÿ = 0 and find that
64
1 = π‘Ÿ 2 π‘œπ‘Ÿ π‘Ÿ = ±8
We consider only the positive root
And proceed to find x:
π‘₯π‘Ÿ = 640; 8π‘₯ = 640;
π‘₯ = 80
So, ordering 80 units each of 8 times per year, inventory cost will be minimized
𝐼𝐢 = 160π‘Ÿ + 16π‘₯ = 160 8 + 16 80 = $2560
[2.6:6] (a) if x is the quantity per order and r is the number of production runs during the year, then the
5
πΌπ‘›π‘£π‘’π‘›π‘‘π‘œπ‘Ÿπ‘¦ πΆπ‘œπ‘ π‘‘ = π‘œπ‘Ÿπ‘‘π‘’π‘Ÿπ‘–π‘›π‘” π‘π‘œπ‘ π‘‘ + π‘π‘Žπ‘Ÿπ‘Ÿπ‘¦π‘–π‘›π‘” π‘π‘œπ‘ π‘‘ = 15000π‘Ÿ + π‘₯
2
We also know the constraint function can be modeled by π‘₯π‘Ÿ = 600000
300000
So, 𝐼𝐢 π‘Ÿ = 15000π‘Ÿ + 5
and 𝐼𝐢 10 = 15000 10 + 5 30000 = 300000
π‘Ÿ
(b) Minimize Inventory Cost :
5
𝐼𝐢 = 15000π‘Ÿ + π‘₯ = 15000π‘Ÿ + 5 300000 π‘Ÿ βˆ’1
2
𝐼𝐢 β€² π‘Ÿ = 15000 βˆ’ 5 300000 π‘Ÿ βˆ’2 = 15000 1 βˆ’ 100π‘Ÿ βˆ’2
To minimize, set 𝐼𝐢 β€² π‘Ÿ = 0 and find that
100
1 = π‘Ÿ 2 π‘œπ‘Ÿ π‘Ÿ = ±10
We consider only the positive root
And proceed to find x:
π‘₯π‘Ÿ = 600000; 10π‘₯ = 600000;
π‘₯ = 60000
So, ordering 60000 units each of 10 times per year [r = 10], inventory cost will be minimized
5
5
𝐼𝐢 = 15000π‘Ÿ + 2 π‘₯ = 15000 10 + 2 60000 = $300000
[2.6:8] We want to minimize 𝐼𝐢 = 40π‘Ÿ + 2π‘₯, where r denotes amount of times per year orders are
placed, and x denotes size of each order. We have the constraint π‘₯π‘Ÿ = 8000. Note that this time, we
are dealing with β€˜maximum’ inventory, not β€˜average’ inventory, which leads to a slight amendment to
the IC.
𝐼𝐢(π‘Ÿ) = 40π‘Ÿ + 2π‘₯ = 40π‘Ÿ + 2
8000
π‘Ÿ
= 40π‘Ÿ + 16000π‘Ÿ βˆ’1
𝐼𝐢 β€² π‘Ÿ = 40 βˆ’ 16000π‘Ÿ βˆ’2 = 40 1 βˆ’ 400π‘Ÿ βˆ’2
To minimize, 𝐼𝐢 β€² π‘Ÿ = 0 and find that
400
1 = π‘Ÿ 2 π‘œπ‘Ÿ π‘Ÿ = ±20
We consider only the positive root
And proceed to find x:
π‘₯π‘Ÿ = 8000;
20π‘₯ = 8000;
π‘₯ = 400
So, ordering 400 units each of 20 times per year [r = 20], inventory cost will be minimized
𝐼𝐢 = 40π‘Ÿ + 2π‘₯ = 40 20 + 2 400 = $1600
[2.6:18] The floor area of an x ft. by y ft. building must equal 12000 feet squared. Therefore, we have
our constraint π‘₯𝑦 = 12000. Further, we want to minimize our costs for putting up walls of such a
building, and cost can be modeled by πΆπ‘œπ‘ π‘‘ = 70𝑦 + 2 50π‘₯ + 50𝑦 where the side of the building with
glass wall has length y.
We are minimizing cost, πΆπ‘œπ‘ π‘‘ = 120𝑦 + 100π‘₯ subject to π‘₯𝑦 = 12000
πΆπ‘œπ‘ π‘‘ 𝑦 = 120𝑦 + 100
12000
𝑦
= 120𝑦 + 100 12000 𝑦 βˆ’1
πΆπ‘œπ‘ π‘‘ β€² 𝑦 = 120 βˆ’ 100 12000 𝑦 βˆ’2 = 120(1 βˆ’ 10000𝑦 βˆ’2 )
To minimize, πΆπ‘œπ‘ π‘‘ β€² 𝑦 = 0 and find that
10000
1 = 𝑦 2 π‘œπ‘Ÿ 𝑦 = ±100
We consider only the positive root
And proceed to find x:
π‘₯𝑦 = 12000;
100π‘₯ = 12000;
π‘₯ = 120
Therefore, a building with dimensions 120 ft. by 100 ft. [where the glass wall is 100ft long] will minimize
total cost
[2.6:20] Using the picture on page 197 of your book, the perimeter of the shape must be 440 yards.
π‘ƒπ‘’π‘Ÿπ‘–π‘šπ‘’π‘‘π‘’π‘Ÿ = 2𝑕 + πœ‹π‘₯ = 440. We want to use that as our constraint to maximize the area of the
rectangular portion of the field, or π‘₯𝑕.
We are maximizing area, 𝐴 = π‘₯𝑕 subject to 2𝑕 + πœ‹π‘₯ = 440
440βˆ’πœ‹π‘₯
πœ‹
𝐴 π‘₯ =π‘₯
= 220π‘₯ βˆ’ 2 π‘₯ 2
2
𝐴′ π‘₯ = 220 βˆ’ πœ‹π‘₯
To maximize, 𝐴′ π‘₯ = 0 and find that
𝟐𝟐𝟎
𝒙=
π’šπ’‚π’“π’…π’” and 𝑕 = 110 yards
𝝅
[2.6:22] Consider a rectangular box with base dimensions x and 2x, and height h.
π‘†π‘’π‘Ÿπ‘“π‘Žπ‘π‘’ π΄π‘Ÿπ‘’π‘Ž = 27 = 2 π‘₯𝑕 + 2 2π‘₯ 2 + 2 2π‘₯𝑕 = 4π‘₯ 2 + 6π‘₯𝑕
We want to maximize 𝑉 = 2π‘₯ π‘₯ 𝑕 = 2π‘₯ 2 𝑕 = 2π‘₯ 2
𝑉 β€² π‘₯ = 9 βˆ’ 4π‘₯ 2 , so setting this equal to zero,
9
4
27βˆ’4π‘₯ 2
6π‘₯
2
=
π‘₯
3
4
3
27 βˆ’ 4π‘₯ 2 = 9π‘₯ βˆ’ π‘₯ 3
3
= π‘₯ , π‘œπ‘Ÿ π‘₯ = ± 2. Let’s consider only the
positive root. The dimensions of the box, then, are
πŸ‘
, πŸ‘, 𝟐
𝟐
𝒇𝒆𝒆𝒕.
[2.6:26] We want to find when the weekly sales amount is falling the fastest, or when the derivative at
its minimum.
1000
4000
𝑓 𝑑 = (𝑑+8) βˆ’ 𝑑+8 2 = 1000 𝑑 + 8 βˆ’1 βˆ’ 4000 𝑑 + 8 βˆ’2
𝑓 β€² 𝑑 = βˆ’1000 𝑑 + 8 βˆ’2 + 8000 𝑑 + 8 βˆ’3
𝑓 β€²β€² 𝑑 = 2000 𝑑 + 8 βˆ’3 βˆ’ 24000 𝑑 + 8 βˆ’4 = 2000 𝑑 + 8 βˆ’3 1 βˆ’ 12 𝑑 + 8 βˆ’1
Setting the second derivative equal to zero will give critical points of the graph of the derivative, which
will tell us about when the derivative is largest/smallest.
12
1 = 𝑑+8 𝒐𝒓 𝒕 = πŸ’ π’˜π’†π’†π’Œπ’”
That is the time that the rate is falling the fastest, or where the derivative f’(t) of the weekly sales f(t) is
minimized. Using test values on either side of 4, we see that f’’ is negative before t=4 and positive after
t=4. This tells us that f’ was decreasing then increasing, in other words reaches a minimum at 4.
Alternatively, we can find f’’’(t) to test concavity of f’(t) at t=4.
𝑓 β€²β€²β€² 𝑑 = βˆ’6000 𝑑 + 8 βˆ’4 + 4 24000 𝑑 + 8 βˆ’5
𝑓 β€²β€²β€² 4 = βˆ’6000 12 βˆ’4 + 4 24000 12 βˆ’5 > 0 so f’(t) is concave up at 4, indicating a
minimum at t=4
[2.7:2] πΆπ‘œπ‘ π‘‘ = 𝐢 π‘₯ = .0001π‘₯ 3 βˆ’ .06π‘₯ 2 + 12π‘₯ + 100
𝐢 β€² (π‘₯) = .0003π‘₯ 2 βˆ’ .12π‘₯ + 12 = .0003 π‘₯ 2 βˆ’ 400π‘₯ + 40000 = .0003 π‘₯ βˆ’ 200 2
There is a critical point at π‘₯ = 200. However, the derivative is always positive, so the cost is
always increasing.
The graph of the marginal cost (C’(x)) is a parabola facing upward (β€œsmiling”) with vertex at 200,
so before x=200, the graph is decreasing. By this logic, at x=100, the marginal cost is decreasing.
The minimum marginal cost, therefore, is at x=200. We could also use the second derivative
(C’’(x)) to find the critical points of the first derivative, resulting in the same conclusion.
[2.7:10] DRAW A PICTURE!!!  We want to minimize the area of a rectangle, π‘Žπ‘, subject to the
constraint 𝑏 = 30 βˆ’ π‘Ž. We get this constraint by realizing that the point (π‘Ž, 𝑏) must lie on the line
𝑦 = 30 βˆ’ π‘₯.
π΄π‘Ÿπ‘’π‘Ž = π‘Žπ‘ = π‘Ž 30 βˆ’ π‘Ž = 30π‘Ž βˆ’ π‘Ž2
π΄π‘Ÿπ‘’π‘Žβ€² = 30 βˆ’ 2π‘Ž
π΄π‘Ÿπ‘’π‘Žβ€² = 0 = 30 βˆ’ 2π‘Ž ; π‘Ž = 15
Further, if π‘Ž = 15, 𝑏 = 30 βˆ’ 15 = 15
The ordered pair (15,15) lies on the line 𝑦 = 30 βˆ’ π‘₯, and when a rectangle is formed with (15,15)
according to the description in the book, the area of the rectangle formed is 225 𝑒𝑛𝑖𝑑𝑠 2
[2.7:12] When price is $50, 4000 tickets are sold. When price is $52, 3800 tickets are sold. Since we are
supposed to assume a linear demand curve, we can use the points (50,4000) and (52, 3800) to find that
π‘‘π‘’π‘šπ‘Žπ‘›π‘‘ = 9000 βˆ’ 100π‘₯. We know, from the chapter, that 𝑅 π‘₯ = π‘₯ βˆ™ π‘‘π‘’π‘šπ‘Žπ‘›π‘‘ = 9000π‘₯ βˆ’ 100π‘₯ 2
Minimizing 𝑅 π‘₯ ,
𝑅 β€² π‘₯ = 9000 βˆ’ 200π‘₯ 𝑖𝑠 0 𝑀𝑕𝑒𝑛 π‘₯ = 45
So when ticket price is $45, revenue is maximized and is equal to $202,500
[2.7:14] Considering our problem context, we can use the line 𝑦 βˆ’ 200 = βˆ’(π‘₯ βˆ’ 100) to represent the
amount brought into the club per person. We are looking for total revenue, so in a process similar to
the book’s treatment of demand and revenue, we will multiply the entire equation by x *memberships+.
This will also reconcile our units, since the current ordered pairs are (memberships, cost/membership).
This gives πΌπ‘›π‘π‘œπ‘šπ‘’ = βˆ’π‘₯ 2 + 300π‘₯. Finding πΌπ‘›π‘π‘œπ‘šπ‘’ β€² π‘₯ = βˆ’2π‘₯ + 300 and setting it equal to zero tells
us that when we sell 150 memberships, our income at the club will be maximized. This does not exceed
the total allowed memberships of 160.
[2.7:16] Considering the context of the problem, we can use the line 𝑦 βˆ’ 36000 = βˆ’300(π‘₯ βˆ’ 100) to
represent the amount per car that contributes to the daily total toll collected [where x is in cents]. In
other words, when we increase the toll by 1 cent, we decrease the cars through the toll road by 300
[slope is -300]. Again, in an effort to reconcile our units, we multiply the entire equation by x cars,
finding that π·π‘Žπ‘–π‘™π‘¦ πΌπ‘›π‘π‘œπ‘šπ‘’ = βˆ’300π‘₯ 2 + 66000π‘₯. The derivative, or
π·π‘Žπ‘–π‘™π‘¦ πΌπ‘›π‘π‘œπ‘šπ‘’ β€² π‘₯ = βˆ’600 + 66000, set equal to zero tells us that when we charge 110 cents (or
$1.10), we will maximize the toll road’s revenue.
[2.7:18] π·π‘’π‘šπ‘Žπ‘›π‘‘ = 200 βˆ’ 3π‘₯
𝑅𝑒𝑣𝑒𝑛𝑒𝑒 = π‘₯ 200 βˆ’ 3π‘₯ = 200π‘₯ βˆ’ 3π‘₯ 2
πΆπ‘œπ‘ π‘‘ = 75 + 80π‘₯ βˆ’ π‘₯ 2
π‘ƒπ‘Ÿπ‘œπ‘“π‘–π‘‘ = 𝑅𝑒𝑣𝑒𝑛𝑒𝑒 βˆ’ πΆπ‘œπ‘ π‘‘
= 200π‘₯ βˆ’ 3π‘₯ 2 βˆ’ (75 + 80π‘₯ βˆ’ π‘₯ 2 )
= βˆ’2π‘₯ 2 + 120π‘₯ βˆ’ 75
β€²
π‘ƒπ‘Ÿπ‘œπ‘“π‘–π‘‘ = βˆ’4π‘₯ + 120
Profit has a critical point when 𝒙 = πŸ‘πŸŽ, which when tested is shown to be a maximum.
[2.7:22] (a) 𝐢 60 = $1100
(b) 𝐢 β€² 40 = $12.50
(c) 𝐢 = $1200 𝑀𝑕𝑒𝑛 π‘₯ = 100
(d) 𝐢 β€² = $22.50 𝑀𝑕𝑒𝑛 π‘₯ = 20 π‘Žπ‘›π‘‘ 140
(e) 𝐢 β€² 𝑖𝑠 π‘šπ‘–π‘›π‘–π‘šπ‘–π‘§π‘’π‘‘ π‘Žπ‘‘ π‘₯ = 80, π‘€π‘•π‘’π‘Ÿπ‘’ 𝐢 β€² = $5
1
[page 213:58] To put the problem in context, let’s consider the line 𝑦 βˆ’ 25 = βˆ’ 2 π‘₯ βˆ’ 40 which
models how the yield/tree changes as we change the amount of trees. We are looking for total yield, not
yield/tree, so in a process similar to the book’s, let’s multiply everything by x *trees+. This gives
π‘₯2
π‘‡π‘œπ‘‘π‘Žπ‘™ π‘Œπ‘–π‘’π‘™π‘‘ = βˆ’ + 45π‘₯. We can maximize yield by taking its derivative, and π‘Œπ‘–π‘’π‘™π‘‘β€² π‘₯ = βˆ’π‘₯ + 45.
2
Setting this equal to zero, we find that our yield is maximized when we have 45 trees in our orchard.
Testing points near 45 will confirm that this is a max.
[page 213: 62] The total distance traveled can be modeled by π‘‘π‘–π‘ π‘‘π‘Žπ‘›π‘π‘’ = 25 + π‘₯ 2 + (15 βˆ’ π‘₯)
Since we are to consider minimizing time, we need to think of our total time in the following way:
25+π‘₯ 2
15βˆ’π‘₯
1
1
π‘‡π‘–π‘šπ‘’ = 8 + 17 = 8 25 + π‘₯ 2 + 17 (15 βˆ’ π‘₯). We don’t have issues with units, because x is in
miles, and our rates are mph.
π‘‡π‘–π‘šπ‘’ β€² π‘₯ =
0=
π‘₯
8
25 + π‘₯ 2
π‘₯
25 + π‘₯ 2
8
βˆ’1/2
βˆ’
8
= π‘₯ 25 + π‘₯ 2 βˆ’1/2
17
8 βˆ’2 25 + π‘₯ 2
=
17
π‘₯2
2
17
25
βˆ’1= 2
8
π‘₯
25
2
π‘₯ =
17 2
βˆ’1
8
π‘₯=
25
17
8
2
=
βˆ’1
βˆ’1/2
βˆ’
1
.
17
To minimize time, we need to find when this derivative is zero.
1
17
25
=
289 64
βˆ’
64 64
25
=
225
64
64 8
=
9
3
[π‘π‘œπ‘›π‘ π‘–π‘‘π‘’π‘Ÿ π‘œπ‘›π‘™π‘¦ 𝑑𝑕𝑒 π‘π‘œπ‘ π‘–π‘‘π‘–π‘£π‘’ π‘Ÿπ‘œπ‘œπ‘‘]
πŸ–
So, to minimize our time, we need to make 𝒙 = πŸ‘ π’Žπ’Šπ’π’†π’”, which means that our total time will be
1
8
25 +
8
3
2
+
1
8
1 25 9
64 1 37
1 17 37 17 37
15 βˆ’
=
+
+
= βˆ™
+
=
+
π‘•π‘œπ‘’π‘Ÿπ‘ 
17
3
8
9
9 17 3
8 3 51 24 51
[which is a little less than 1.5 hours] to make our trip.