This is the corrected exercise set for optimization problems in MATH 140, Calculus 1, at McGill University, section 4.7 of Stewart. It is where the whole course is used at once: a figure becomes a function, the chain and product rules produce the derivative, and the extreme value results of the previous chapters decide the answer. Every number is exact and chosen to be done by hand, and each solution names the theorem that licenses its conclusion, because an optimum given without its justification earns only part of the marks.
The thread running through the whole set: a critical number is only a CANDIDATE, and the domain, read from the geometry before anything is differentiated, decides. On a closed interval the closed interval method compares the candidates with BOTH endpoints; on an open or unbounded domain the sign of the derivative on the WHOLE domain proves the global extremum. The same gesture is posed on every exercise, with its variants: the critical number outside the domain, the endpoint that wins, the endpoint that is a real object and must be compared exactly.
The traps named in the solutions: answering with the critical number instead of the quantity asked, keeping a critical number that describes an impossible box, stopping at a second derivative test that only proves a local extremum, forgetting that the closed interval method is unavailable on an open domain, giving the minimum of d2 as the distance, squaring an equation without checking signs, and reporting the unconstrained optimum when a capacity or a land limit moves the answer to an endpoint.
Self-checking setType your answers and check them question by question: the page tells you right or wrong before you open the solution. With an account, every answer right on the first try earns points, and your right answers stay filled in when you come back.
•Method: figure and variables, constraint, objective in ONE variable, domain from the situation, candidates, then a justification of the absolute extremum, then the answer to the question asked.
•Closed interval method: f continuous on [a,b]; compare f at the critical numbers in (a,b) and at a and b. The largest value is the absolute maximum.
•First derivative test for absolute extreme values: if f′>0 for all x<c and f′<0 for all x>c in the domain, f(c) is the absolute maximum (reverse signs for a minimum).
•One critical number: on an interval, a single critical number that is a local extremum is the absolute one. f′′<0 on the whole domain also licenses a maximum.
•Since t and t2 (for t≥0) are increasing, minimize d2 instead of d, and maximize A2 instead of A≥0: same point, different value.
•Classics: can of fixed volume h=2r; Norman window h=r; square sheet box x=6a; cylinder in a cone r=32R, h=3H.
Part A: the basics (/50)
Exercise 1: The method on a divided pasture: constraint, objective, domain, global maximum
Every optimization problem is solved in the same five moves: name the variables on a figure; write the CONSTRAINT that links them; write the OBJECTIVE function in one variable; give its DOMAIN, read from the situation; then find the absolute extremum AND justify that it is absolute. The derivative only supplies candidates. The last move is where marks are lost.
A farmer has 600 m of fencing to enclose a rectangular pasture along a straight river, and to split it into two pens by one fence perpendicular to the river, as in the figure. No fence is needed along the river. Let x be the length of each of the three fences perpendicular to the river and y the length of the side parallel to it, in metres.
a) Write the constraint, the total area A as a function of x alone, and the domain of x. Explain why the two endpoints of the domain may be included.
b) Find the critical number of A and use the closed interval method to find the dimensions of the pasture of largest area, and that area.
c) The farmer's land only extends 80 m back from the river, so x≤80. Find the dimensions of the largest pasture now.
d) A classmate answers b) with: A′′(x)=−6<0, so x=100 is a maximum. What exactly does this prove, and why is the maximum global here anyway?
e) With L metres of fencing and n pens (so n+1 fences perpendicular to the river), prove that the optimal side parallel to the river is always y=2L.
b)x=100 m, y=300 m, A=30000 m2 (two pens of 100 by 150 m)
c)A′>0 on [0,80]: x=80 m, y=360 m, A=28800 m2
d)A′′(100)<0 only gives a LOCAL maximum; it is global because it is the only critical number in [0,200] and A(0)=A(200)=0.
e)x=2(n+1)L, so y=L−(n+1)x=2L
a)
Counting the fence on the figure: three pieces of length x and one of length y, so the constraint is 3x+y=600, that is y=600−3x. The objective is the total area A=xy, and substituting the constraint, A(x)=x(600−3x)=600x−3x2. The domain comes from the geometry, not from the formula: x≥0 and y≥0, and y=600−3x≥0 gives x≤200. So x∈[0,200]. The endpoints are degenerate pastures of area 0 (no depth, or all the fence used across the river), and including them costs nothing: it makes the domain a CLOSED interval, on which the continuous polynomial A is guaranteed an absolute maximum by the Extreme Value Theorem. That is the licence for the closed interval method.
b)
A′(x)=600−6x, which is 0 for x=100, inside [0,200]. There is no point where A′ fails to exist. Closed interval method: compare the values at the critical number and at BOTH endpoints: A(0)=0, A(200)=0, A(100)=100×300=30000. The absolute maximum is 30000 m2, reached for x=100 m and y=600−300=300 m. The answer the question asks for is the DIMENSIONS and the AREA: a pasture 300 m along the river and 100 m deep, split into two pens of 100 m by 150 m, total area 30000 m2. Writing only x=100 answers a question nobody asked.
c)
The domain is now [0,80]. The only critical number, 100, is OUTSIDE it and is not a candidate. On [0,80], A′(x)=600−6x≥600−480=120>0, so A is increasing and its maximum is at the right endpoint: x=80 m, y=600−240=360 m, A=80×360=28800 m2. The closed interval method gives the same answer: A(0)=0<A(80). Reporting the unconstrained answer x=100 here designs a pasture that does not fit on the land, and costs the whole question. The optimum of a constrained problem is often ON the boundary, with a derivative that is not 0 there.
d)
A′′(100)=−6<0 is the second derivative test: it proves that x=100 is a LOCAL maximum, that is, larger than the nearby values, and nothing about far away values. Two arguments make it global here, and one of them must be written. Either the closed interval method of b), which compares with the endpoints; or the fact that x=100 is the ONLY critical number on the interval [0,200] and is a local maximum, so A increases before it and decreases after it, and no other value can beat it. A local maximum with no justification of this kind is worth part of the marks only, because the next exercise with a larger endpoint will make the same sentence false.
e)
Now (n+1)x+y=L, so A(x)=x(L−(n+1)x)=Lx−(n+1)x2 on [0,n+1L]. A′(x)=L−2(n+1)x=0 gives x=2(n+1)L, inside the interval, and A vanishes at both endpoints, so this is the absolute maximum. Then y=L−(n+1)2(n+1)L=2L. Check with b): L=600, n=2 gives x=100 and y=300. Whatever the number of pens, half the fence runs along the river side: a result worth remembering to check a numerical answer in two seconds.
Tick the exercises you have done or want to review: a free account, no password, keeps your ticks and your right answers from one visit to the next, tells you which chapter to tackle next and lets you ask for the exercise you are missing. Create your space, an email is enough.
Exercise 2: The open box cut from a sheet: the domain comes from the geometry
A rectangular sheet of cardboard measures 16 cm by 10 cm. A square of side x cm is cut from each corner and the four flaps are folded up along the dashed lines to make a box WITHOUT a lid. We want the box of largest volume.
The figure shows the sheet, the four squares to remove and the fold lines. Every critical number must be tested against the geometry before it is used.
a) Express the length, width and height of the box in terms of x, then the volume V(x) expanded, and the domain of x.
b) Compute V′(x), factor it, and find the critical numbers. Which one is rejected, and why?
c) Use the closed interval method to find the largest volume and the dimensions of that box.
d) A student computes V′′(320)>0 and writes that the box of MINIMUM volume has x=320. Correct this.
e) The same construction from a SQUARE sheet of side a. Prove that the best cut is x=6a, find the maximum volume in terms of a, and apply it to a=18 cm.
Show the solution
Answers
a)(16−2x) by (10−2x) by x; V(x)=4x3−52x2+160x; domain [0,5]
c)V(0)=V(5)=0, V(2)=144: the box 12 cm by 6 cm by 2 cm, 144 cm3
d)320 is outside [0,5] (a negative width); the minimum volume is 0, at the endpoints.
e)V=x(a−2x)2, V′=(a−2x)(a−6x); x=6a, Vmax=272a3; for a=18: x=3, V=432 cm3
a)
Removing a square of side x at each end of a side shortens it by 2x: the base is (16−2x) by (10−2x), and the folded flaps give the height x. So V(x)=x(16−2x)(10−2x)=4x(8−x)(5−x)=4x(40−13x+x2)=4x3−52x2+160x. Domain: every dimension must be ≥0, so x≥0, x≤8 and x≤5. The SHORT side decides: x∈[0,5]. The endpoints are flat boxes of volume 0; they are included to make the interval closed.
b)
V′(x)=12x2−104x+160=4(3x2−26x+40)=4(3x−20)(x−2), as expanding (3x−20)(x−2)=3x2−26x+40 confirms. The critical numbers are x=2 and x=320. Since 320>5, it is NOT in the domain: cutting squares of side 320≈6.7 cm from a sheet 10 cm wide is impossible, the two cuts would overlap. The formula V(x) knows nothing about cardboard; only the domain does. The candidate x=2 is kept.
c)
Closed interval method on [0,5]: V(0)=0, V(5)=5×6×0=0, V(2)=2×12×6=144. The largest volume is 144 cm3, for the box of base 12 cm by 6 cm and height 2 cm. Check that V is continuous on [0,5] (a polynomial) before invoking the method: that sentence is the licence, and it is one line. A quick plausibility check: V(1)=1×14×8=112 and V(3)=3×10×4=120, both below 144.
d)
V(320)=320⋅38⋅(−310)=−271600, a NEGATIVE volume, which says it all: the point is outside the domain and describes no box. The second derivative test was applied to a point that should never have been tested. The minimum volume on [0,5] is 0, at the two endpoints, and it is a degenerate box. The general rule: reject a critical number outside the domain BEFORE any test, and say why in words.
e)
V(x)=x(a−2x)2 on [0,2a]. By the product and chain rules, V′(x)=(a−2x)2+x⋅2(a−2x)(−2)=(a−2x)[(a−2x)−4x]=(a−2x)(a−6x). Critical numbers: x=2a (an endpoint, V=0) and x=6a. With V(0)=V(2a)=0, the maximum is V(6a)=6a(32a)2=6a⋅94a2=272a3. For a=18: x=3 cm and V=272×5832=432 cm3, which checks directly: 3×12×12=432. Factoring V′ by the common factor (a−2x) instead of expanding is the gesture that keeps the numbers small.
Exercise 3: The can of fixed volume: an open domain, and no endpoint to test
A closed cylindrical can must hold 250π cm3. The figure shows the can and its net: two disks of radius r and a rectangle of width 2πr (the circumference) and height h. We want to use as little metal as possible.
Here the domain of r is OPEN: no radius is forbidden, but no radius is an endpoint either. The closed interval method is then unavailable, and the global minimum needs another licence.
a) Write the area of metal A in terms of r and h, the volume constraint, and A(r) in one variable.
b) Give the domain of r and the behaviour of A(r) as r→0+ and as r→∞. Why can the closed interval method not be used?
c) Find the critical number and justify that it gives the ABSOLUTE minimum. State the dimensions of the can and the least area of metal.
d) The top and bottom are cut from a metal that costs twice as much per cm2 as the side. Find the radius of the cheapest can and the ratio rh.
e) For a can of any fixed volume V made of a single metal, prove that the optimal can has h=2r.
Show the solution
Answers
a)A=2πr2+2πrh, πr2h=250π, A(r)=2πr2+r500π
b)(0,∞); A→∞ at both ends; no endpoint to evaluate
c)A′<0 on (0,5), A′>0 on (5,∞): r=5 cm, h=10 cm, A=150π cm2
d)r3=2125, r=325 cm; rh=4
e)r3=2πV and rh=πr3V=2
a)
The net has two disks of area πr2 and a rectangle of area 2πr⋅h, so A=2πr2+2πrh. The constraint is the volume: πr2h=250π, so h=r2250. Substituting, A(r)=2πr2+2πr⋅r2250=2πr2+r500π. Solve the constraint for the variable that is easy to isolate, here h, never for r, which would bring a square root.
b)
Any r>0 gives a can, with h=r2250>0, so the domain is (0,∞): open at 0 and unbounded. As r→0+, r500π→∞ (a tall thin needle with an enormous side); as r→∞, 2πr2→∞ (a huge flat coin). So A(r)→∞ at both ends. There is no endpoint at which to evaluate A, and the Extreme Value Theorem, which requires a closed interval, does not apply: nothing guarantees a minimum in advance. The justification must come from the derivative on the WHOLE domain.
c)
A′(r)=4πr−r2500π=r24π(r3−125). On (0,∞) the denominator is positive, so the sign of A′ is that of r3−125: negative for 0<r<5, zero at r=5, positive for r>5. Hence A is decreasing on (0,5] and increasing on [5,∞): A(5) is smaller than EVERY other value, the first derivative test for absolute extreme values. (Equivalently, A′′(r)=4π+r31000π>0 on the whole domain, so the only critical number is the absolute minimum.) The can: r=5 cm, h=25250=10 cm, and A(5)=50π+100π=150π cm2. Answering the minimum is 5 confuses the radius with the area: the question asked for dimensions and area.
d)
The cost is proportional to 2⋅2πr2+2πrh (each disk counts twice), so we minimize C(r)=4πr2+r500π on (0,∞). C′(r)=8πr−r2500π=r24π(2r3−125), negative then positive around r3=2125, so the absolute minimum is at r=325=2534 cm. For the shape, use the constraint instead of computing h: rh=r3250=125/2250=4. The cheap can is twice as tall, relative to its radius, as the can of c): a dearer lid pushes the design toward a smaller lid.
e)
With h=πr2V, A(r)=2πr2+r2V and A′(r)=4πr−r22V=r24πr3−2V, negative before and positive after r3=2πV: the absolute minimum. Then rh=πr3V=πV⋅V2π=2, so h=2r: the height equals the diameter. c) is the case V=250π: h=10=2×5. Real cans are taller than this because the lid is thicker metal and the seams cost too, which is exactly the effect measured in d).
Exercise 4: The closest point on a curve: minimize the square of the distance
The distance from A(a,b) to a point P(x,y) is d=(x−a)2+(y−b)2. Differentiating a square root is legal but heavy. Since t↦t is increasing on [0,∞), the distance d and its square D=d2 are smallest at the SAME point: we minimize D, and take the square root only at the very end, for the value.
The figure shows the curve y=x, the point A(3,0) and a point P(x,x) of the curve.
a) Find the point of the curve y=x closest to A(3,0), justify that the minimum is absolute, and give the least distance.
b) Same curve, point B(41,0). A student solves D′(x)=0 and finds x=−41. Find the closest point.
c) For the point (a,0) with a>0, find the closest point of the curve, depending on a.
d) Find the point of the branch xy=4, x>0, closest to the origin, and the least distance.
e) In a), check that the segment AP is perpendicular to the tangent line at the closest point P, and explain why a student who answers 411 for the distance loses a mark.
Show the solution
Answers
a)D(x)=x2−5x+9; P(25,25), dmin=211
b)D′=2x+21>0 on [0,∞): the origin, at distance 41 (x=−41 rejected)
c)x=a−21 if a≥21; the origin if 0<a<21
d)(2,2), at distance 22
e)Slopes 25/21 and −225, product −1; 411 is D, the distance is 211.
a)
D(x)=(x−3)2+(x−0)2=x2−6x+9+x=x2−5x+9, on the domain [0,∞) of the curve. D′(x)=2x−5, zero at x=25, inside the domain. The domain is not closed and bounded, so justify on the WHOLE domain: D′<0 on [0,25) and D′>0 on (25,∞), so D decreases then increases and D(25) is its absolute minimum. D(25)=425−225+9=425−50+36=411. The closest point is P(25,25)=(25,210), and the least distance is 411=211. The endpoint x=0 gives D=9, larger, as it must.
b)
D(x)=(x−41)2+x=x2+2x+161 and D′(x)=2x+21. The root x=−41 is NOT in the domain [0,∞): the curve y=x has no point there. On the domain, D′(x)≥21>0, so D is increasing and its minimum is at the endpoint x=0: the closest point is the origin, at distance D(0)=161=41. The student's equation had a solution and the problem still had its answer elsewhere, at an endpoint where D′=0.
c)
D(x)=(x−a)2+x, D′(x)=2x−2a+1, zero at x=a−21. If a≥21, this is in [0,∞), D′ changes from negative to positive there, and the closest point has x=a−21 (for a=3, x=25, as in a)). If 0<a<21, the root is negative, D′>0 on the domain, and the closest point is the origin (b) is a=41). Same method, two answers, and the switch happens exactly when the critical number leaves the domain.
d)
On the branch, y=x4, so D(x)=x2+x216 on (0,∞), an OPEN domain. D′(x)=2x−x332=x32(x4−16), negative for 0<x<2 and positive for x>2. So x=2 gives the absolute minimum: the point (2,2), with D(2)=4+4=8 and distance 8=22. The symmetry of the curve about y=x predicted the point; the sign of D′ is what proves it. Note that D→∞ at both ends of the domain, as for the can of Exercise 3.
e)
At x=25 the tangent slope is 2x1=25/21. The slope of AP is 25−35/2−0=−225. Their product is −25/225/2=−1: the shortest segment from a point to a smooth curve meets it at a right angle, a two second check of any closest point answer. As for 411: it is the minimum of D, the SQUARE of the distance. The trick of minimizing D changes the function, not the point; the value asked must be brought back through the square root.
Exercise 5: The rectangle inscribed in a semicircle: area, then perimeter
A rectangle has its base on the diameter of a semicircle of radius 5 and its two upper corners on the arc, as in the figure. By symmetry, its upper right corner is (x,y) with x2+y2=25, y≥0, so the rectangle is 2x wide and y=25−x2 high.
The same figure answers two different questions, and the two answers differ: an optimum belongs to the objective function, not to the figure.
a) Write the area A(x) of the rectangle and the domain of x.
b) Find the rectangle of largest area, justifying that the maximum is absolute. Where does A′ fail to exist, and does it matter?
c) Redo b) by maximizing A(x)2 instead of A(x). Why is this legitimate?
d) Find the rectangle of largest PERIMETER inscribed in the same semicircle. Compare with the endpoints exactly, without a calculator.
e) Compare the shapes of the two optimal rectangles of b) and d).
Show the solution
Answers
a)A(x)=2x25−x2 on [0,5]
b)x=25: base 52, height 252, area 25; A′ undefined at the endpoint 5 only
c)A2=4(25u−u2) with u=x2: u=225, same rectangle
d)x=25, y=5, P=105, larger than P(0)=10 and P(5)=20
e)Base twice the height for the area, four times the height for the perimeter.
a)
The rectangle is 2x by y=25−x2, so A(x)=2x25−x2. The corner must lie on the arc in the first quadrant: 0≤x≤5. At x=0 the rectangle is a vertical segment, at x=5 a horizontal one, both of area 0. A is continuous on the closed interval [0,5].
b)
Product rule, and chain rule with inner function 25−x2: A′(x)=225−x2+2x⋅225−x2−2x=25−x22(25−x2)−2x2=25−x250−4x2 for 0≤x<5. A′(x)=0 gives x2=225, x=25 (the negative root is outside the domain). A′ does not exist at x=5: that point is a critical number in the wide sense, but it is an endpoint, already on the list of the closed interval method. Values: A(0)=0, A(5)=0, A(25)=2⋅25⋅225=2⋅225=25. The largest rectangle has base 2x=52, height 25=252 and area 25, the square of the radius.
c)
A(x)≥0 on [0,5], and t↦t2 is increasing on [0,∞), so A and A2 are largest at the same x. With u=x2∈[0,25]: A2=4x2(25−x2)=4(25u−u2), a downward parabola in u with vertex u=225, inside [0,25]. So x=25 again, with no square root to differentiate. The same trick as the distance in Exercise 4, with the same warning: the maximum of A2 is 625, the area is 625=25. It is legitimate only because A≥0: squaring a quantity that changes sign can move its maximum.
d)
The perimeter is P(x)=2(2x)+2y=4x+225−x2 on [0,5]. P′(x)=4−25−x22x, zero when 225−x2=x. Both sides are ≥0 on the domain, so squaring is safe: 4(25−x2)=x2, x2=20, x=25, and then y=25−20=5. Closed interval method: P(0)=10 (the vertical segment, counted twice), P(5)=20 (the diameter, counted twice) and P(25)=85+25=105. Exact comparison: 105>20 because 5>2, since 5>4. The maximum perimeter is 105, for the rectangle 45 by 5. Here an endpoint value is NOT zero, and skipping the comparison would leave the answer unproved.
e)
For the area, base 52 and height 252: the base is TWICE the height, so the rectangle is two squares side by side. For the perimeter, base 45 and height 5: the base is FOUR times the height, a flatter rectangle, because the perimeter rewards width more than the area does. The same figure, two objective functions, two answers: the first line of every solution must say which quantity is optimized.
Part B: problems and reasoning (/50)
Exercise 6: The Norman window: an endpoint whose value is not zero
A Norman window is a rectangle surmounted by a half-disk whose diameter is the top side of the rectangle. Its frame, the whole outline of the window, measures 8 m. With the notation of the figure, the rectangle is 2r wide and h high, and the half-disk has radius r. We want to let in as much light as possible.
In the previous exercises the endpoints of the domain were degenerate figures of area 0. Here one of them is a perfectly good window, and its value must be compared with the candidate, exactly and without a calculator.
a) Write the constraint on the perimeter, the area A of the window as a function of r alone, and the domain of r.
b) Find the critical number, then apply the closed interval method. Compare the values exactly.
c) Show that, at the optimum, the height of the rectangle equals the radius, and give the largest area.
d) The half-disk is now made of stained glass, which lets through only half as much light per m2 as clear glass. Find the radius that maximizes the light, justifying the absolute maximum, and the ratio rh.
e) Compare the two optimal windows of c) and d), and explain the difference in one sentence.
Show the solution
Answers
a)2h+2r+πr=8; A(r)=8r−24+πr2 on [0,2+π8]
b)r=4+π8; A(0)=0, A(2+π8)=(2+π)232π<4+π32
c)h=r=4+π8 m, Amax=4+π32 m2
d)r=8+3π16 m (vertex of a downward parabola, inside the domain); rh=44+π
e)The stained glass window is taller (h>r): light is moved from the dim half-disk to the clear rectangle.
a)
The outline is two vertical sides h, the bottom 2r and the half-circle πr: 2h+2r+πr=8, so h=28−(2+π)r. The area is A=2rh+2πr2, and substituting, A(r)=r(8−(2+π)r)+2πr2=8r−2r2−πr2+2πr2=8r−24+πr2. Domain: r≥0 and h≥0, that is (2+π)r≤8, so r∈[0,2+π8]. At the right endpoint, h=0: the window is a half-disk alone, a real window with a real area.
b)
A′(r)=8−(4+π)r=0 for r=4+π8, which is in the domain since 4+π>2+π. Values: A(0)=0; at the candidate, A=4+π64−24+π⋅(4+π)264=4+π64−4+π32=4+π32; at the right endpoint, only the half-disk remains: A=2π(2+π8)2=(2+π)232π. Exact comparison: 4+π32>(2+π)232π is equivalent to (2+π)2>π(4+π), that is 4+4π+π2>4π+π2, that is 4>0. True. The candidate wins, and the comparison took one line of algebra instead of a calculator.
c)
With r=4+π8: h=28−(2+π)4+π8=28⋅4+π(4+π)−(2+π)=4+π8=r. The height of the rectangle equals the radius of the half-disk, whatever the perimeter (the 8 factors out). The largest area is 4+π32 m2, about 4.5 m2 using π≈3.14, for a window 4+π16 m wide. Stating h=r is a check worth writing: a result this clean rarely comes out of a wrong computation.
d)
The light is proportional to L=2rh+21⋅2πr2=r(8−(2+π)r)+4πr2=8r−(2+43π)r2, on the same domain. L′(r)=8−(4+23π)r=0 for r=4+3π/28=8+3π16. Justification by concavity on the WHOLE domain: L′′(r)=−(4+23π)<0 everywhere, so L is a downward parabola and its only critical number is the absolute maximum on any interval that contains it; and it is in the domain, since 8+3π16≤2+π8 amounts to 32+16π≤64+24π. Then h=2(8+3π)8(8+3π)−16(2+π)=8+3π16+4π, and rh=1616+4π=44+π.
e)
In c), rh=1; in d), rh=1+4π>1, and the radius 8+3π16 is smaller than 4+π8 (compare 16(4+π)=64+16π with 8(8+3π)=64+24π). Since the half-disk now pays full price in frame but returns only half the light, the optimum shrinks it and spends the frame on a taller clear rectangle. Changing the objective moved the optimum, as in Exercise 5, and the method, candidate then global justification, did not change at all.
Exercise 7: Row, then walk: the fastest route, and when the endpoint wins
A woman is in a rowboat at A, 3 km from the nearest point C of a straight shore. She wants to reach the village B, on the shore 8 km from C, as fast as possible. She rows at 3 km/h and walks at 5 km/h. She will land at a point P between C and B, at distance x km from C, as in the figure.
Time is distance over speed, leg by leg. The domain is a closed interval, and both endpoints are genuine routes: row straight to C, or row all the way to B.
a) Write the total time T(x) in hours and its domain.
b) Find the critical number of T, justifying each step of the resolution.
c) Apply the closed interval method, comparing the three values exactly, and describe the fastest route and its duration.
d) Same boat, same speeds, but the village is only 2 km from C. Find the fastest route.
e) Show that the landing point does not depend on the distance CB as long as CB≥49 km, and express the optimality condition with the angle θ=∠CAP.
Show the solution
Answers
a)T(x)=39+x2+58−x on [0,8]
b)T′(x)=39+x2x−51=0 gives x=49
c)T(0)=513, T(49)=512, T(8)=373: land 49 km from C, total 512 h =2 h 24 min
d)T′<0 on [0,2]: row straight to the village, T(2)=313 h
e)x=49 comes from 9+x2x=53, free of CB; that is sinθ=53, the ratio of the speeds.
a)
Rowing covers AP=9+x2 km (Pythagoras in the right triangle ACP) at 3 km/h, and walking covers PB=8−x km at 5 km/h. So T(x)=39+x2+58−x, for x∈[0,8]. Landing beyond B or before C only adds distance, so nothing is lost by this domain.
b)
Chain rule, inner function 9+x2: T′(x)=31⋅29+x22x−51=39+x2x−51. T′(x)=0 means 5x=39+x2. Both sides are ≥0 for x≥0, so squaring creates no false root on the domain: 25x2=81+9x2, 16x2=81, x=49 (−49 is outside the domain, and would not even satisfy the unsquared equation). T′ exists everywhere on [0,8].
c)
T(0)=33+58=513. At x=49: 9+1681=16225, so AP=415 and T=1215+2023=2025+2023=512. T(8)=373. Exact comparisons: 512<513 is clear, and 512<373 amounts to 36<573, that is 1296<1825 after squaring positive numbers. The fastest route: row to the point 49 km from C, then walk the remaining 423 km, in 512 h, that is 2 h 24 min. A decimal like T(8)≈2.85 is fine as a comment, never as the comparison itself.
d)
Now T(x)=39+x2+52−x on [0,2], with the same derivative. Its only zero, 49, is outside [0,2]. Since 9+x2x increases with x, T′(x)<T′(49)=0 on [0,2]: T is decreasing and the minimum is at the endpoint x=2. She rows straight to the village, in T(2)=313 h. Check against the other endpoint: T(0)=1+52=57, and 313<57 amounts to 513<21, that is 325<441. Solving T′=0 and answering x=49 would send her past the village.
e)
The distance CB appears in T only through the term −5x plus a constant, so it disappears from T′: the equation 39+x2x=51 does not involve it. As long as the root 49 lies in [0,CB], it is the landing point. In the triangle ACP, sinθ=APCP=9+x2x, and the condition reads sinθ=53, the ratio of the rowing speed to the walking speed: check with x=49, 15/49/4=53. Light obeys the same rule when it crosses from air to water, which is why the fastest path bends.
Exercise 8: Five statements to correct
Each statement below was written on a MATH 140 assignment, and each is false. Say what is wrong, give a counterexample, and write the correct statement.
a) Once A′(x)=0 is solved, the problem is finished: in the pasture problem, the maximum area is x=100.
b) A local maximum of the objective function is its absolute maximum.
c) Minimizing the square of a distance may give a different point from minimizing the distance itself.
d) On a closed interval, the absolute maximum of a differentiable function is at a point where its derivative is 0.
e) Every optimization problem has an answer, since a continuous function always reaches a maximum and a minimum.
Show the solution
Answers
a)False: x=100 is a candidate and a length. Justify the global maximum, then answer 300 m by 100 m, 30000 m2.
b)False: x3−6x2+9x+1 on [0,5] has a local max 5 at x=1 and f(5)=21. True if it is the ONLY critical number of an interval.
c)False: t is increasing, so d and d2 have the same minimizer; only the VALUE changes.
d)False: with the cap x≤80, the maximum is at x=80 where A′=120. The maximum is at a critical number OR an endpoint.
e)False: the can of fixed volume has no MAXIMUM area, A→∞. The Extreme Value Theorem needs a CLOSED interval.
a)
FALSE, twice. First, A′(x)=0 only produces a candidate: without the closed interval method or a sign argument on the whole domain, nothing says it is the maximum, and the next problem will have a larger endpoint. Second, x=100 is a length, not an area, and the question asked for the dimensions and the largest area. Correct statement: the critical number is a candidate; after justifying that it gives the absolute maximum, the answer is the quantity asked, here a pasture of 300 m by 100 m of area 30000 m2.
b)
FALSE. f(x)=x3−6x2+9x+1 on [0,5]: f′(x)=3(x−1)(x−3), a local maximum f(1)=5, a local minimum f(3)=1, and yet f(5)=125−150+45+1=21>5. A local maximum is only larger than its NEIGHBOURS. Correct statement: if c is the ONLY critical number of f on an interval and f has a local maximum at c, then f(c) is the absolute maximum on that interval (with two critical numbers, as here, the endpoints must be compared).
c)
FALSE. For D=d2≥0, d=D, and t↦t is increasing on [0,∞): whenever D(x1)<D(x2), d(x1)<d(x2). So d and D are smallest at the same point. What differs is the VALUE: in Exercise 4 a), minD=411 while the least distance is 211. Correct statement: minimizing d2 gives the same point as minimizing d; the least distance is the square root of the least value of d2. The same holds for A2 when A≥0.
d)
FALSE. In the pasture with the land cap x≤80, A(x)=600x−3x2 is largest at x=80, where A′(80)=120=0. A maximum at an endpoint has no reason to have a horizontal tangent; f(x)=x on [0,1] is the simplest example. Correct statement: on a closed interval, a continuous function reaches its absolute maximum at a critical number (where f′=0 or f′ does not exist) OR at an endpoint, which is why the closed interval method lists both.
e)
FALSE. The Extreme Value Theorem needs a continuous function on a CLOSED and bounded interval. For the can of Exercise 3, A(r)=2πr2+r500π on the open domain (0,∞) tends to ∞ at both ends: the can using the MOST metal does not exist, whatever the calculus says. Correct statement: on a closed interval the optimum exists; on an open or unbounded domain it must be proved, by the sign of the derivative on the whole domain or by the behaviour at the ends, and it may fail to exist, in which case that is the answer.
Exercise 9: Pricing concert tickets: revenue, a sold-out hall, and profit
A concert organizer surveys demand. At 50 dollars a ticket, 500 tickets would sell, and each 1 dollar cut in the price sells 20 more tickets (each 1 dollar increase loses 20). The figure shows the resulting demand line and the capacity of the first hall considered, 600 seats.
Price against demand is the classic trade-off: a higher price earns more per ticket and sells fewer tickets. The revenue is R=pq, price times quantity sold.
a) Show that the number of tickets sold at price p is q=1500−20p, and give the domain of p for which the model makes sense.
b) In a very large hall, find the price that maximizes the revenue, the number of tickets sold and the revenue, with a justification of the absolute maximum.
c) In the 600-seat hall, find the price that maximizes the revenue, and the revenue.
d) In a 1000-seat hall, each spectator costs 10 dollars (staff, security) and the evening costs 5000 dollars in fixed charges. Find the price that maximizes the PROFIT, and the profit.
e) Redo d) with q as the variable, and interpret the condition you obtain.
c)q≤600 gives p≥45; R′<0 on [45,75]: p=45, sold out, R=27000 dollars
d)Π(p)=(p−10)(1500−20p)−5000 on [25,75]; p=42.5 dollars, q=650, Π=16125 dollars
e)R′(q)=75−10q=10=C′(q): q=650; stop where the last ticket brings in exactly what it costs.
a)
Lowering the price from 50 to p is a cut of 50−p dollars, which sells 20(50−p) extra tickets: q=500+20(50−p)=1500−20p. The formula also covers increases (p>50 gives 50−p<0). Check: p=50 gives q=500, the survey point on the figure. The model needs p≥0 and q≥0, that is p≤75: domain [0,75].
b)
R(p)=p(1500−20p)=1500p−20p2, continuous on [0,75]. R′(p)=1500−40p=0 for p=37.5. Closed interval method: R(0)=0 (free tickets), R(75)=0 (nobody comes), R(37.5)=37.5×750=28125. The best price is 37.50 dollars, which sells 750 tickets for a revenue of 28125 dollars. Note that the answer is a price, a number of tickets and an amount of money: three quantities, all asked.
c)
The hall adds a constraint: q≤600, that is 1500−20p≤600, p≥45. The domain becomes [45,75], and the candidate 37.5 is outside it. On [45,75], R′(p)=1500−40p≤1500−1800=−300<0, so R is decreasing and its maximum is at the left endpoint p=45: exactly 600 tickets, a sold-out hall, and R=45×600=27000 dollars. The solution figure shows the parabola cut by the capacity line. Charging 37.50 dollars here would sell only 600 of the 750 tickets demanded, for 22500 dollars: the unconstrained answer is not just suboptimal, it is 4500 dollars worse.
d)
The capacity now requires 1500−20p≤1000, that is p≥25, so the domain is [25,75]. Profit is revenue minus cost: Π(p)=p(1500−20p)−10(1500−20p)−5000=(p−10)(1500−20p)−5000. Product rule: Π′(p)=(1500−20p)+(p−10)(−20)=1700−40p, zero for p=42.5, inside [25,75]. Values: Π(25)=15×1000−5000=10000, Π(75)=65×0−5000=−5000, Π(42.5)=32.5×650−5000=21125−5000=16125. The best price is 42.50 dollars, selling 650 tickets for a profit of 16125 dollars. The profit price is higher than the revenue price of b): each extra spectator now costs 10 dollars, so selling fewer tickets at a higher price pays.
e)
Solving q=1500−20p for p: p=75−20q, so R(q)=75q−20q2 and the cost is C(q)=10q+5000. Π′(q)=R′(q)−C′(q)=75−10q−10=0 gives q=650, and then p=75−32.5=42.5: the same answer, which is the check. The condition R′(q)=C′(q) says: keep selling tickets as long as one more ticket brings in more money than it costs, and stop when the two are equal. Π′′(q)=−101<0 on the whole domain, so this candidate is the absolute maximum without evaluating any endpoint, the second licence.
Exercise 10: A final exam problem: the largest cylinder inside a cone
A right circular cylinder is inscribed in a right circular cone of base radius 6 cm and height 12 cm: the base of the cylinder sits on the base of the cone, and its top circle touches the cone all around. The figure is the vertical cross-section through the axis: a triangle, and inside it the rectangle 2r by h.
This is the shape of a long final exam question: set up the constraint from the geometry, optimize, justify, then change the objective and generalize, with exact answers and every step named.
a) Use similar triangles to express h in terms of r, and give the domain of r.
b) Find the dimensions of the cylinder of largest volume and that volume, justifying that the maximum is absolute.
c) What fraction of the volume of the cone does this cylinder fill?
d) Find instead the cylinder of largest LATERAL area S=2πrh inscribed in the same cone.
e) For a cone of base radius R and height H, find the cylinder of largest volume and show that the fraction of c) does not depend on the cone.
Show the solution
Answers
a)12h=66−r, so h=12−2r; domain [0,6]
b)V(r)=12πr2−2πr3, V′=6πr(4−r); r=4 cm, h=4 cm, V=64π cm3
c)144π64π=94
d)S(r)=2πr(12−2r): r=3 cm, h=6 cm, S=36π cm2
e)r=32R, h=3H, V=274πR2H=94⋅3πR2H
a)
In the cross-section, the right half of the triangle has legs 6 (along the base) and 12 (along the axis). Above the top of the cylinder, the small triangle with apex at the top of the cone has height 12−h and half-width r, and it is similar to the big one: 6r=1212−h. Hence 12−h=2r and h=12−2r. Domain: r≥0 and h≥0, so r∈[0,6]; at r=0 the cylinder is the axis, at r=6 it is the flat base, both of volume 0. Naming the similar triangles is the method mark: h=12−2r written without them is a guess.
b)
V(r)=πr2h=πr2(12−2r)=12πr2−2πr3, continuous on [0,6]. V′(r)=24πr−6πr2=6πr(4−r): critical numbers 0 (an endpoint) and 4. Closed interval method: V(0)=0, V(6)=0, V(4)=π×16×4=64π. The same conclusion reads on the sign of V′: positive on (0,4), negative on (4,6). The largest cylinder has radius 4 cm and height h=12−8=4 cm, and volume 64π cm3. Its height equals its radius, not its diameter: this cylinder is short and wide.
c)
The cone has volume 31π×62×12=144π cm3, so the cylinder fills 144π64π=94 of it, a little less than half. The comparison is a sanity check too: a cylinder inscribed in a cone must fill less than the whole cone, and more than nothing.
d)
S(r)=2πr(12−2r)=24πr−4πr2 on [0,6], with S(0)=S(6)=0. S′(r)=24π−8πr=0 for r=3, and S(3)=2π×3×6=36π. The cylinder of largest lateral area has radius 3 cm and height 6 cm, a different cylinder from b): the area grows like r and the volume like r2, so the volume pushes toward wider cylinders. As in Exercises 5 and 6, the optimum belongs to the objective, and the first line of the answer names it.
e)
Similar triangles give Rr=HH−h, so h=H(1−Rr) on [0,R], and V(r)=πH(r2−Rr3). V′(r)=πH(2r−R3r2)=πHr(2−R3r), zero at r=32R, with V(0)=V(R)=0 and V>0 in between, so this is the absolute maximum. Then h=H(1−32)=3H and V=π⋅94R2⋅3H=274πR2H. The cone has volume 3πR2H=279πR2H, so the fraction is 94 for EVERY cone. With R=6 and H=12: r=4, h=4, as in b).
Something missing from this set?A type of exercise your teacher gives, a problem you are stuck on, a mistake you spotted: tell me, I read every request.
Sending goes through your free space: that is how I can answer you and tell you when the exercise is added. An email is enough, no password. Create your space.
Rather not create an account? Write to me directly.