§ 01What Is an Optimisation Problem?
An optimisation problem asks: among all configurations satisfying certain constraints, which one makes some quantity as large or as small as possible? Calculus answers this question with precision, and the answer is almost always a critical point.
Every optimisation problem has two components. The objective function is the quantity you want to maximise or minimise: the area of a rectangle, the cost of materials, the time of a journey. The constraint is a condition that limits the possible configurations, the perimeter is fixed, the volume must equal a given value, the path cannot leave a certain region.
The power of calculus is that it converts these verbal descriptions into algebra, and then finds the optimal configuration by locating the critical points of the objective function. Without calculus, you could check finitely many configurations by trial and error. With calculus, you find the exact optimum among infinitely many possibilities in a handful of steps.
§ 02The Five-Step Strategy
Every optimisation problem (from the simplest geometry exercise to a complex engineering design) can be solved with the same five steps. Mastering this procedure is the key to this entire topic.
§ 03Closed-Interval vs Open-Interval Methods
The method you use to confirm an optimum depends on whether the domain is a closed interval or an open interval (or all of ℝ).
AND at the endpoints Q(a) and Q(b).
The absolute max is the largest of these values; the absolute min is the smallest.
§ 04Geometry Problems
Let the rectangle have half-dimensions x and y, so width = 2x, height = 2y. The constraint is that the corners lie on the circle: x² + y² = r².
Objective: A = 4xySet A′(x) = 0: r² − 2x² = 0 ⟹ x = r/√2
A″ < 0 at x = r/√2 (maximum). Then y = r/√2 also. Width = height = r√2.
Let width = x, length = y. Constraint: 2x + 2y = 200 ⟹ y = 100 − x. Domain: x ∈ (0, 100).
A″(x) = −2 < 0 everywhere, so x = 50 is a maximum.
One side is a long wall: only three sides of fencing are needed. Let the side parallel to the wall have length x, and the two perpendicular sides have length y each.
Note: the side parallel to the wall is twice as long as each perpendicular side, a general rule for this problem type.
§ 05Container and Surface Area Problems
Cut equal squares of side x from each corner, fold up the sides to form an open box.
Base side = 12 − 2x, height = x. Domain: x ∈ (0, 6).
x = 2 or x = 6. Only x = 2 ∈ (0, 6).
V″(x) = −96 + 24x. V″(2) = −48 < 0. ✓ Maximum.
Let radius = r, height = h. Both positive.
S″(r) = 4π + 4000/r³ > 0 for all r > 0. So this is a minimum. ✓
h = 1000/(πr²) = 2r ≈ 10.84 cmThe optimal cylinder always satisfies h = 2r (height = diameter), regardless of the target volume. This is why most drink cans have height approximately equal to their diameter.
An open-topped box has a square base of side x and height h. The base costs R2/m² and the four sides cost R1/m² each. Minimise total cost.
C″(x) = 4 + 256/x³ > 0. ✓ Minimum.
§ 06Economics and Revenue Problems
Domain: q ≥ 0. For p ≥ 0, need q ≤ 25.
R″ = −4 < 0. ✓ Maximum.
P″(q) = −2q + 12. P″(12.71) = −25.42 + 12 = −13.42 < 0. ✓ Maximum.
§ 07Distance and Travel Problems
A general point on y = x² is (x, x²). Its distance from (0, 3) is:
D = √(x² + (x²−3)²)Minimising D is equivalent to minimising D² (easier):
f(x) = x² + (x²−3)² = x² + x⁴ − 6x² + 9 = x⁴ − 5x² + 9x = 0 or x² = 5/2 ⟹ x = ±√(5/2)
f(0) = 9 f(±√(5/2)) = (5/2)² − 5(5/2) + 9 = 25/4 − 25/2 + 9 = 11/4 = 2.75
Minimum is at x = ±√(5/2).
§ 08Common Mistakes
§ 0910-Question Quiz
Questions cover setup, critical point finding, endpoint checking, and applied reasoning across all four problem types.