Quadratic Optimization: Free Response
5 questions in parts, 52 points in total. Work each one out on paper, taking a hint if you get stuck. When you have an answer, reveal the answer to check it, and the full solution only if you still want it. The rubric is there so you can mark your own work.
-
1. Two vertices, two different questions . Foundational, 9 points. Question 1 of 5.
Two quadratic quantities are given: and . One part below asks for a VALUE; another asks for an INPUT. Read carefully and answer exactly what is asked, no more and no less.
- Part A.
The quantity has a minimum. Find the minimum value.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
The quantity has a maximum. Find the optimizing input, that is, the value of at which the maximum occurs, not the maximum value itself.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Explain why finding the optimizing input in part B does not, by itself, give you the maximum value of that same quantity, and name the one additional step that would.
Explain why it works A sentence or two. Reasons, not steps. 3 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
Every vertex has two coordinates, an input and a value, and a question about one is not automatically answered by finding the other. Work out which coordinate each part is actually asking for before you compute anything.
-
Hint 2 of 3 · Part A
For part A, use to find where the minimum happens, then substitute that number back into the equation. What the question wants is what comes out of that substitution.
-
Hint 3 of 3 · Part B
For part B, the phrase optimizing input tells you exactly which vertex coordinate to report. Stop the moment you have it: this part does not ask you to substitute it back in.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
The minimum value is .
Part B
The optimizing input is .
Part C
A vertex has two separate coordinates; the input is only one of them. Substituting that input back into the original equation, and simplifying, is the step that produces the value.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The quantity opens upward since , so its vertex is the LOWEST point, a minimum. Find the input first.
Substitute that input back into the original equation to get the value.
The minimum value is , reached at .
Part B
The quantity opens downward since , so its vertex is the HIGHEST point, a maximum. This part asks only for WHERE that happens, the input.
The optimizing input is . Substituting it back would give the maximum value, a different number, but this part does not ask for that.
Part C
A vertex is a POINT, , with two coordinates. Part B found only the first one, the input , by solving . That formula never looks at , and it stops the moment it produces a single number.
To get the second coordinate, the value, you still have to take that input and put it back into the original expression:
Only after carrying out that substitution and simplifying do you have the quantity's actual maximum. Finding the input is the first half of locating the vertex, not the whole job.
In one line
The minimum value of is ; the optimizing input of is ; and locating an input never hands you the value, since the vertex has two separate coordinates and the value needs the input substituted back into the equation.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Uses to locate the vertex input, then substitutes that input back into the equation. . Worth 2 points.
Reports specifically the minimum VALUE, not the input at which it occurs. . Worth 1 point.
Part B 3 points
Correctly computes the vertex input using and , handling both signs correctly. . Worth 2 points.
Reports specifically the optimizing INPUT, not the value the quantity reaches there. . Worth 1 point.
Part C 3 points
Explains that a vertex has two separate coordinates, so locating the input in part B fixes only one of them. . Worth 2 points. needs an explanation, not just an answer
Names the specific remaining step, substituting the input back into the original equation, that would produce the value. . Worth 1 point.
-
-
2. A garden that borrows one side from the house . Application, 10 points. Question 2 of 5.
A homeowner is building a rectangular vegetable garden against the back wall of the house, so the wall supplies one side and metres of fencing are available for the other three sides.
- Part A.
Let be the length of each of the two sides that run out from the wall. Write the length of the side parallel to the wall in terms of , and write the garden's area as a quadratic in .
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 3 points
- Part B.
Find the dimensions, the length of each side out from the wall and the length of the side parallel to it, that give the greatest possible area.
Carry your own answer forward Use the area expression you set up in part A, even if it is not fully expanded.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
State the greatest possible area of the garden, and explain in one sentence why this is a different question from the one part B answered.
Carry your own answer forward Substitute your optimizing value of from part B into the area expression from part A, or multiply the two dimensions you found.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
This garden only needs fencing on three sides, since the wall supplies the fourth for free. Do not spend any of the metres fencing a side that is already there.
-
Hint 2 of 3 · Part A
Let one pair of equal sides be . Whatever fence is left after those two sides is what forms the side parallel to the wall; write that leftover length in terms of before multiplying for area.
-
Hint 3 of 3 · Part B
Once the area is a quadratic in , its vertex input comes from . Find that first, and only then get the parallel side by substituting it into its own expression, not into the area formula.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
Parallel side: metres. Area: square metres.
Part B
Each side out from the wall is metres, and the side parallel to the wall is metres.
Part C
The greatest area is square metres. That is the optimal VALUE; part B's two lengths are the optimizing INPUT. The two answer different questions about the same vertex.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The wall supplies one side for free, so the metres of fence cover only the other three: two sides of length running out from the wall, and one side parallel to the wall. Whatever fence is left after the two -sides forms that parallel side:
Area is length times width, so
This is a quadratic in with and .
Part B
Since , the area opens downward, so its vertex is a maximum. Find the optimizing .
Each side out from the wall is metres. Substitute that into the parallel-side expression from part A, not into the area formula, to get the second dimension.
The side parallel to the wall is metres.
Part C
The dimensions from part B are the optimizing INPUT; the area they enclose is the optimal VALUE, a different question. Multiply the two side lengths.
The greatest possible area is square metres. Reporting and again would answer part B a second time, not this part: this part wants the single number the vertex's height represents.
In one line
The area is with the parallel side ; the greatest area comes from sides of metres out from the wall and metres parallel to it; and the greatest area itself is square metres, a separate number from those two dimensions.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Recognizes that the wall replaces one side, so only two -length sides and one parallel side need fencing, and gets the parallel side by subtracting those two sides from the total fence, not from a full four-sided perimeter. . Worth 2 points.
Multiplies the two dimensions to express the area as a single quadratic in . . Worth 1 point.
Part B 4 points
Finds the optimizing by applying to the area expression from part A. . Worth 2 points.
Substitutes that into the PARALLEL SIDE expression, not the area formula, to get the second dimension. . Worth 1 point.
Reports the two side lengths only, the dimensions asked for, not the area they enclose. . Worth 1 point.
Part C 3 points
Correctly computes the area from the two dimensions found in part B. . Worth 2 points.
Explains that the area is the vertex's optimal VALUE, while part B's dimensions are the optimizing INPUT, so the two are not interchangeable answers. . Worth 1 point. needs an explanation, not just an answer
-
-
3. What the sign of a decides, and does not . Reasoning, 10 points. Question 3 of 5.
A claim: the sign of a quadratic quantity's leading coefficient does not just decide between a maximum and a minimum, it also decides whether that best value itself is positive. Specifically, a negative leading coefficient always produces a positive maximum, and a positive leading coefficient always produces a positive minimum.
- Part A.
Refute the first half of the claim: produce one quadratic quantity with a negative leading coefficient whose maximum value is not positive, and show the vertex computation that proves it.
Construct a counterexample Give one specific case, and show it breaks the claim. 4 points
- Part B.
The claim conflates two separate facts about a vertex. State the ONE thing the sign of actually decides, and state what it does NOT decide about the resulting value.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part C.
Now test the second half of the claim: compute the actual minimum value of , and state whether that number confirms or refutes the claim's promise about positive leading coefficients.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
The claim bundles two separate jobs into one: deciding up-versus-down, and deciding the sign of the resulting number. Test whether the sign of can really do both jobs at once.
-
Hint 2 of 3 · Part A
Pick any downward-opening quadratic () whose constant term is a large enough negative number that the whole thing stays negative even at its peak. Compute its vertex to check.
-
Hint 3 of 3 · Part C
Run the exact same kind of check on an upward-opening quadratic. A minimum can sit below the horizontal axis just as easily as a maximum can, whatever the sign of was.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
Take . Here , so the vertex is a maximum, occurring at , but the maximum value is , which is negative. One such example is enough to refute a claim made for ALL quadratics with .
Part B
The sign of decides only whether the vertex is a maximum or a minimum. It does not decide the sign of that extreme value: a maximum can be negative, and a minimum can be negative too, since and also fix where the vertex sits vertically.
Part C
The minimum value is , which is negative. This refutes the second half of the claim as well: a positive leading coefficient guarantees a minimum, but never guarantees that the minimum is positive.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The claim says a negative leading coefficient always produces a positive maximum. To disprove a claim about ALL such quadratics, one honest counterexample is enough.
Take , where . Find its vertex.
Substitute back for the value.
The vertex is a maximum, since , but its value is , a negative number. The claim promised a positive maximum; this one is not. That single example is enough to refute the claim as stated for every quadratic with .
Part B
Go back to the argument behind the vertex: writing , the sign of decides only whether or , that is, whether the vertex is a floor or a ceiling. Nothing in that argument touches the sign of itself.
The value is set by completing the square on all of , , and together, not by alone. Two quadratics can share the same and still have their vertex sit above the axis, on it, or below it, depending on and . So the sign of answers whether the vertex opens up or down, never whether the resulting number is positive or negative.
Part C
The claim's second half concerns quadratics with . Test it on , where .
Substitute back for the value.
The vertex is a minimum, since , but its value is , a negative number. The second half of the claim fails for exactly the same reason the first half did: the sign of never touches the sign of the extreme value.
In one line
A negative leading coefficient does not guarantee a positive maximum: has but its maximum value is . The sign of decides only up versus down, never the sign of the resulting number, which also depends on and ; the same failure shows up on the positive side, since has but a minimum of .
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Chooses a specific quadratic with to test the claim, rather than arguing about quadratics in general. . Worth 1 point.
Correctly finds the vertex of the chosen quadratic, including substituting back for the value, and gets a negative result. . Worth 2 points.
States that this one example is enough to refute a claim asserted for every quadratic with . . Worth 1 point.
Part B 3 points
Separates what the sign of actually decides, maximum versus minimum, from what it does not decide, the sign of the resulting value. . Worth 2 points. needs an explanation, not just an answer
States that the value's sign depends on the quadratic's other coefficients too, not on in isolation. . Worth 1 point.
Part C 3 points
Correctly finds the vertex of , including substituting back for the value. . Worth 2 points.
States plainly whether the computed value confirms or refutes the claim's second half. . Worth 1 point.
-
-
4. A price the parabola would not pick . Application, 13 points. Question 4 of 5.
A minor-league baseball team sells tickets to a home game at a price of dollars each. Ticket-office data shows that each dollar increase in price is expected to cost the team ticket sales.
- Part A.
Let be the number of dollar price increases from dollars. Write the number of tickets sold, and the revenue , as expressions in .
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 3 points
- Part B.
Find the ticket price that maximizes revenue, and find the maximum revenue itself. Report both numbers, and be clear about which is which.
Carry your own answer forward Use the revenue expression you built in part A, even if it is not fully expanded.
Solve and show your work Write each step out, and end with the value and its units. 6 points
- Part C.
The team's manager instead sets the price at dollars. Compute the revenue at that price, and explain in one sentence why it comes out below the maximum from part B, tying your answer to the shape of the revenue parabola.
Carry your own answer forward Use the revenue expression from part A.
Compare the two methods Say what each one costs you, and when you would reach for it. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
Two different variables are floating around here: , the number of dollar increases, and the actual ticket price, . Keep straight which one each part wants.
-
Hint 2 of 3 · Part B
Build the revenue expression first, then use on it. That hands you , not the price: add it to before you report a price.
-
Hint 3 of 3 · Part C
Revenue is a downward parabola with exactly one highest point. Any price other than the one at that peak sits somewhere on one of the two falling sides.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
Tickets sold: . Revenue: .
Part B
The price that maximizes revenue is dollars, reached at . The maximum revenue itself is dollars, a separate number from the price.
Part C
At a price of dollars the revenue is dollars, below the -dollar maximum. Revenue is a downward parabola with exactly one peak, so any price other than the one from part B lands on one of its falling sides.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Each dollar price increase costs ticket sales, so after increases the price is dollars and the number sold is .
Revenue is price times quantity:
This is the model; expanding it is the next part's job.
Part B
Expand the model from part A to see its coefficients.
Since , the vertex is a maximum. Find the optimizing .
The question asks for the PRICE, not itself, so add it to the base price: dollars.
Substitute back into for the maximum revenue.
The maximum revenue is dollars, a separate number from the dollar price.
Part C
A price of dollars is dollars above the base price of , so . Substitute into the revenue expression from part A.
The revenue at dollars is dollars, below the -dollar maximum from part B. Revenue is a downward parabola with exactly one highest point, at ; moving away from that single peak in either direction, including to , can only land on a lower point of the curve.
In one line
, where is the number of dollar increases; the revenue-maximizing price is dollars, giving a maximum revenue of dollars; and the manager's dollar price gives only dollars, since it falls away from the vertex of the downward revenue parabola.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Builds the number of tickets sold by taking away sales for every dollar increase from the starting count, and builds the price by adding that same number of increases to the starting price. . Worth 2 points.
Multiplies these two expressions to state the revenue as a single product. . Worth 1 point.
Part B 6 points
Finds the optimizing by applying to the expanded revenue expression. . Worth 2 points.
Converts into the actual ticket PRICE, , since price rather than is what the question asks for. . Worth 1 point.
Substitutes the optimizing back into to compute the maximum revenue. . Worth 2 points.
Reports the maximum revenue as a separate figure from the price, not the two run together. . Worth 1 point.
Part C 4 points
Correctly computes the revenue at the manager's proposed price. . Worth 2 points.
Explains that because the revenue parabola opens downward with a single peak, any price other than the one from part B necessarily gives a lower revenue. . Worth 2 points. needs an explanation, not just an answer
-
-
5. Two platforms, one launch . Reasoning, 10 points. Question 5 of 5.
A ball is launched straight up with an initial speed of feet per second. One version of the experiment launches it from a foot platform, so its height is ; a second version launches the same ball from a foot platform, so its height is . Everything else about the launch is the same.
- Part A.
Find the time at which each version reaches its peak height.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Find the maximum height each version reaches.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Using your answers from parts A and B, compare the two peak times with each other, and separately compare the two peak heights with each other. Describe what you notice in each comparison, and explain it in terms of which of the coefficients , , the optimizing input depends on, and which the optimal value additionally depends on.
Carry your own answer forward Use whatever times you found in part A and whatever heights you found in part B, even if a number did not come out as expected.
Compare the two methods Say what each one costs you, and when you would reach for it. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
The two versions of this launch share the same part and differ only in the constant added at the end. Ask which of the vertex's two coordinates that constant can actually move.
-
Hint 2 of 3 · Part A
The peak TIME comes from , a formula built only out of and . Check what changes between the two platforms' equations and what does not.
-
Hint 3 of 3 · Part C
Once you have both peak times and both peak heights, line them up in a small table before you write the explanation. Patterns are easier to name once they are side by side.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
Both platforms reach their peak at seconds.
Part B
The foot platform peaks at feet; the foot platform peaks at feet.
Part C
The two peak times are equal, since uses only and , which match for both versions. The two peak heights differ by exactly the foot gap between the platforms, because substituting back also brings in , the coefficient that changed.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Both height equations share the same part, so and for each. The peak time depends only on those two coefficients.
That computation never used either constant term, so both the foot platform and the foot platform peak at the same time, seconds.
Part B
Substitute into each platform's own height equation, including its own starting height.
For the foot platform:
For the foot platform:
The two maximum heights are feet and feet.
Part C
Line the two comparisons up. The peak times from part A are the same number for both platforms, because is built only out of and , and those two coefficients never changed between the versions.
The peak heights from part B are not the same: substituting the shared time back into adds in , the starting height, which is the one number that did change between the platforms, by feet. That is exactly the gap between the two heights found in part B.
So the optimizing input answers a question that has no say in, while the optimal value is a question always gets a vote on.
In one line
Both platforms peak at seconds, since the peak time only uses and , which are identical for the two versions. Their peak heights differ, by exactly the foot gap between the platforms, because substituting back in also brings in , the one coefficient that changed.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Correctly computes the peak TIME for each of the two platforms using . . Worth 2 points.
Reports a time for each platform, not a height. . Worth 1 point.
Part B 3 points
Substitutes each platform's own peak time into its OWN height equation to find each maximum height. . Worth 2 points.
Reports a height for each platform, distinct from the times found in part A. . Worth 1 point.
Part C 4 points
Accurately states how the two peak times compare to each other, and separately how the two peak heights compare to each other, based on the student's own computed values. . Worth 2 points.
Explains the pattern by identifying that the optimizing input depends only on and , while the optimal value additionally depends on . . Worth 2 points. needs an explanation, not just an answer
-