Quadratic Optimization
Learning goals
- Locate the best value at the vertex
- Read the sign of to tell a maximum from a minimum
- Separate where the best occurs from how good it is
- Model a problem as a quadratic, then answer what was asked
- Apply it to fixed perimeter, revenue and projectile height
Why the vertex is the best value
Take any quadratic quantity written as . From the parabola lesson you can find its vertex in two moves: the input is
and the value there is whatever you get by substituting that back into the equation. If the quadratic is already in vertex form , it is even quicker, because the vertex is . The value at the vertex is then sitting right in front of you.
Which of the two, a maximum or a minimum, you have found is decided entirely by the sign of . A positive opens the parabola upward into a valley, so the vertex is the lowest point and has a minimum there. A negative opens it downward into a hill, so the vertex is the highest point and has a maximum. There is no separate rule to memorize for word problems. Instead, read the sign of the leading coefficient, and you know whether the vertex is a floor or a ceiling.
Why the vertex holds the largest or smallest value#
Write the quadratic in vertex form by completing the square, , where the vertex is . Everything hangs on the squared piece . A square is never negative, so , and it equals at exactly one input, .
Suppose . Multiplying a nonnegative number by a positive number keeps it nonnegative, so , and therefore
The value can never dip below , and it actually reaches only when the square is , that is at . So is the smallest value the quadratic ever takes: a minimum, occurring at the vertex.
Now suppose . Multiplying a nonnegative number by a negative number makes it nonpositive, so , and therefore . This time can never rise above , and it reaches only at , so is the largest value: a maximum, again at the vertex.
Either way the extreme value is , the height of the vertex, and it is reached at the single input . The sign of alone decides which extreme it is. This is why optimizing a quadratic is never a search through many inputs. There is one special point, and the two-step vertex calculation lands on it directly.
This picture is worth holding in your mind for the rest of the lesson. The quantity you want to make as large or as small as possible traces a parabola, and you are simply locating its peak or its valley.
Before any word problems, practice the pure mechanics on a bare quadratic, keeping the input and the value in separate boxes in your head.
Worked example 1 The maximum value of
The leading coefficient is . Since the parabola opens downward, so its vertex is the highest point and the quantity has a maximum. Find the input where that happens with , reading and :
The maximum occurs at the input . To get the maximum value, substitute back into the equation:
So the maximum value of is , and it happens at . Notice how different those two numbers are. If a question asks for the maximum value, the answer is ; the number is only where it occurs. Answering to “what is the maximum” is the classic slip this lesson is built to prevent.
Check your understanding
Find the minimum value of .
The leading coefficient is , so the parabola opens upward and the vertex is the lowest point. The minimum occurs at with and .
That is the input, not the answer. Substitute it back to get the minimum value:
So the minimum value is , reached at . Choosing answers the wrong question: is where the minimum happens, and is the minimum itself.
A method for optimization problems
Real problems arrive as sentences, not as . Turning the words into a quadratic reuses the same modeling discipline you built for quadratic applications. There is one change at the end: instead of setting the quantity equal to a target and solving, you find its vertex.
- Name the variable. Pick a letter for the quantity you get to choose (a width, a price, a time), and write every other quantity in the problem in terms of it.
- Build the quadratic. Express the thing you want to make biggest or smallest (an area , a revenue , a height , a product ) as a quadratic in your variable.
- Find the vertex. Compute the optimizing input with , and read the sign of to confirm you have a maximum () or a minimum ().
- Answer the exact question, with units. Decide whether the problem wants the optimizing input, the optimal value, or both, then substitute back as needed and state the result in a sentence. Check that the answer is physically sensible (a length is positive, a count is a whole number).
Step 4 is where the input-versus-value distinction earns its keep. “What price maximizes revenue” wants the input; “what is the greatest revenue” wants the value. A question that says “find the dimensions of the largest pen” wants the inputs, and the area they produce is a separate follow-up. Read the final sentence of the problem carefully and give back precisely what it asks.
Greatest area for a fixed amount of fence
Area problems are the heart of this topic, because area is a product of two lengths. When a fixed perimeter ties those two lengths together, the product of the two becomes a quadratic. A fixed supply of fence is the usual setup.
Worked example 2 Largest rectangular pen from 40 metres of fence
A farmer has metres of fencing to enclose a rectangular pen. What dimensions enclose the greatest area, and what is that area?
Name the width (in metres). The four sides are two widths and two lengths, and they use all metres, so , which gives a length of . Area is length times width:
This is a quadratic in with and . Since the parabola opens downward, so its vertex is a maximum. The optimizing width is
The width is metres, and the length is metres, so the best pen is a by square. Its area is the value at the vertex:
The greatest area is square metres. For a fixed perimeter, the maximum-area rectangle always turns out to be a square, which the algebra has just confirmed.
That last claim is worth catching in the act rather than taking on trust, because it rests on many different rectangles sharing a single perimeter. The figure below reports both quantities for whatever rectangle you build, so you can pin one of them and watch the other.
Hold the perimeter at by keeping the width and the height adding to . Now walk along that family: by , then by , by , by , and finally by . The perimeter readout never leaves , while the area climbs , , , , . The square is the peak. Keep going past it to by and by . The areas then run back down through and , mirroring the values on the way up. That mirror is the axis of symmetry of , and the top of the climb is its vertex, which locates without any of this walking. One more setting is worth visiting for contrast: build by , then by . The first reports perimeter and area , the second perimeter and area . Equal areas, and nothing like equal perimeters. So one perimeter can go with many areas, and one area with several perimeters. That is exactly why an optimization problem has to say which of the two it is holding fixed before “the best rectangle” means anything at all.
Rectangle explorer
A rectangle 3 units wide and 7 units tall. Perimeter 20 units. Area 21 square units.
Change the setup so the pen backs onto a wall, and only three sides need fencing. The wall gives one side for free, so the fence is split differently, but the method does not budge.
Worked example 3 Largest pen against a wall with 60 metres of fence
A rectangular garden is built against a long straight wall, so the wall forms one side and fencing is needed only for the other three. With metres of fence, what is the largest area?
Let be the length of each side that runs out from the wall (there are two of these). The remaining fence forms the side parallel to the wall, so that side is . The area is
Here and , and signals a maximum. The optimizing input is
Each side out from the wall is metres, and the side parallel to the wall is metres. The greatest area is
So the largest garden is square metres, from a by rectangle. Notice the shape is no longer a square: freeing up one side with the wall changes the balance. In this setup the side parallel to the wall comes out twice as long as each of the other two.
The same product structure runs through pure number problems. Two numbers with a fixed sum have a product that is a quadratic. With the sum held fixed, that product is largest when the two numbers are equal, which is the number version of the square being the best rectangle.
Check your understanding
Two positive numbers add up to . What is the greatest possible value of their product?
Name one number ; since the two add to , the other is . Their product is a quadratic.
With the vertex is a maximum, at . So both numbers are , and the greatest product is
The answer is the product , not the number that achieves it. The two equal numbers are what a fixed sum wants for the biggest product.
Greatest revenue
Money problems create a quadratic whenever raising the price drives down the number sold. Revenue is price times quantity, and if the quantity falls off in a straight line as the price climbs, that product is again a quadratic with a peak.
Worked example 4 The ticket price that maximizes revenue
A theater sells tickets per show at dollars each. A survey predicts that every dollar increase in the ticket price will sell fewer tickets. What price brings in the greatest revenue?
Let be the number of dollar increases. Then the price is dollars, and the number of tickets sold is . Revenue is price times quantity:
Expand so you can see the coefficients:
Here and , and means the vertex is a maximum. The optimizing number of increases is
Five increases means the best price is dollars, at which the theater sells tickets. The greatest revenue is the value at the vertex:
So a ticket price of dollars maximizes revenue, bringing in dollars. The question asked for the price, so dollars is the headline answer; the revenue of dollars is a separate figure. The raw vertex input (the number of increases) is neither of those, just a step along the way.
A projectile’s highest point
The falling-object model from the applications chapter is a quadratic in time, so its highest point is a vertex. Near the surface of the Earth an object thrown into the air has height
with the starting height and the initial upward speed. In metric units the same model reads with the height in metres. The leading coefficient is negative in both, so the graph of height against time is a downward parabola, and its vertex is the top of the flight. The input at the vertex is the time the object peaks; the value there is the maximum height. Keep those two apart exactly as before.
Worked example 5 Maximum height of a launched ball
A ball is launched upward from a foot platform with an initial speed of feet per second. So its height in feet after seconds is . Find the maximum height and the time it occurs.
The coefficients are , , and . Because , the vertex is the highest point. The time at the peak is
The ball peaks at seconds. That is the time, not the height. Substitute back to get the maximum height:
The maximum height is feet, reached at seconds. A question that asks “how high” wants feet; a question that asks “when” wants seconds. The model hands you both, one as the vertex input and one as the vertex value.
Check your understanding
A stone thrown upward has height feet after seconds. At what time does it reach its maximum height?
The height is a downward parabola (), so the peak is at the vertex. The question asks when, which is the vertex input, using and .
So the stone peaks at seconds. The trap answer feet is the maximum height, , which answers a different question. Watch which one the prompt wants: here it is the time, seconds.
Least cost and other minimums
When the leading coefficient is positive the parabola opens upward, and the vertex becomes a lowest point rather than a highest one. Everything about the method is identical; only the sign of has flipped, and with it the word “maximum” becomes “minimum”. Costs that fall and then rise are a natural home for these.
Worked example 6 The production level that minimizes cost
A workshop finds that its daily cost in dollars to make units of a product is . How many units should it make to minimize the cost, and what is that minimum cost?
The coefficient is positive, so the parabola opens upward and the vertex is the lowest point, a minimum. The optimizing number of units is
Making units minimizes the cost. The minimum cost is the value there:
So the workshop should make units, and the least possible daily cost is dollars. The positive leading coefficient is the whole reason this is a minimum. The cost drops as production rises toward units, bottoms out there, and climbs again beyond it.
Everything in this lesson comes back to one image. Whatever the quantity, area, revenue, height, product, or cost, if it is a quadratic then its graph is a parabola. The answer you want is the peak or the valley of that parabola. Find the vertex, check the sign of to know which one it is, and then read off precisely the input or the value the question asks for.