3.3Optimisation problems
The idea
Optimisation: turn the story into a function of one variable, set the derivative to zero, then check it is the max or min you want.
Think of it like this: Finding the best dosage: too little does nothing, too much harms, the best is in between.
Why it exists
Quadratic profiles (arches, profit curves) appear as quick word problems.
How it works
- Write the quantity as y(x).
- Solve y′(x) = 0 (for ax² + bx + c, x = −b/2a).
- Check the type: a < 0 gives a maximum.
- Plug x back in to get the optimum value, and confirm it is allowed.
Worked example: GATE 2012
The arch is y = 2x − 0.1x². Then y′ = 2 − 0.2x = 0 gives x = 10, and y = 20 − 10 = 10 m, the maximum height.
Now play with it
- →Set a = −0.1, b = 2, c = 0 in the vertex lab.
- →Change a to positive and watch the max turn into a min.
Default a = −0.1, b = 2, c = 0 is the GATE 2012 arch y = 2x − 0.1x²: vertex at x = 10, height 10. No calculus needed for a quadratic, but f′ = 2ax + b = 0 gives the same x.
| x | f(x) | type (from f″) |
|---|---|---|
| 10 | 10 | local max |
y′ = 2 − 0.2x = 0 at x = 10, and y = 20 − 10 = 10 m is the maximum height.
Check yourself
The maximum value of y = 8x − x² is
Exam notes (the dense version)
Write the quantity to optimise as a function of one variable, set its derivative to 0, and check the type. For a quadratic ax² + bx + c the extremum is at x = −b/2a, a minimum if a > 0 and a maximum if a < 0, with value c − b²/4a. GATE 2012: arch y = 2x − 0.1x² has its maximum at x = 10, so the greatest height is 20 − 10 = 10 m. Always verify that the optimum lies inside the allowed range.
Previous year questions: Maxima, Minima & Taylor Series (3)
PYQs are grouped by topic, so this is the full set for Maxima, Minima & Taylor Series; try the ones that match this subtopic. Open all 3 on the topic page.