Calculus I · Textbook draft · 18 minute reading

Optimization as a Modeling Problem

Translate a constraint into a feasible domain, then justify a global optimum with calculus and boundary analysis.

Before you begin

  • Critical numbers, EVT, sign charts, and elementary geometry.

Learning objectives

  • Separate objective, constraint, and feasible domain.
  • Reduce a constrained problem to one variable.
  • Establish a global optimum rather than merely a stationary point.

An optimization problem does not begin with a derivative. It begins by deciding what is being optimized, which quantities may change, and what restrictions connect them. Different assumptions create different mathematics even when the objects look similar.

A rectangle beside a wall

A rectangular enclosure needs fencing on three sides because an existing wall supplies the fourth. Let xx be each perpendicular side and yy the parallel fenced side, in metres. With 6060 metres of fencing, 2x+y=602x+y=60. The objective is area A=xyA=xy. Substituting the constraint gives

A(x)=x(60−2x),0≤x≤30.A(x)=x(60-2x),\qquad 0\leq x\leq30.

The closed interval includes degenerate rectangles so that boundary behavior is explicit. The polynomial is continuous, so EVT gives a global maximum. Since A′=60−4xA'=60-4x, the only interior stationary point is x=15x=15, giving y=30y=30 and area 450450 square metres. The endpoint areas are zero. This comparison establishes the absolute maximum. Alternatively, A=450−2(x−15)2A=450-2(x-15)^2 proves the same conclusion without differentiation.

If fencing were required on all four sides, the constraint would be 2x+2y=602x+2y=60 and the maximizing rectangle would be a square of side 1515, area 225225. A correct derivative applied to the wrong constraint solves the wrong problem perfectly.

An open box

Cut squares of side xx from the corners of a 1212 by 1212 centimetre sheet and fold the sides. The volume is

V(x)=x(12−2x)2,0≤x≤6.V(x)=x(12-2x)^2,\qquad 0\leq x\leq6.

Differentiation in factored form gives

V′=(12−2x)(12−6x).V'=(12-2x)(12-6x).

The interior stationary point is x=2x=2, giving dimensions 88 by 88 by 22 and volume 128128 cubic centimetres. Both endpoints give zero volume. The factor 12−2x12-2x also vanishes at 66, but that is an endpoint, not an additional interior stationary box. We have checked the entire feasible interval, including the cases that are geometrically degenerate.

Minimizing on an unbounded interval

A closed cylinder has prescribed volume V0>0V_0>0. With radius r>0r>0 and height hh, πr2h=V0\pi r^2h=V_0 and surface area is

S(r)=2πr2+2V0r.S(r)=2\pi r^2+\frac{2V_0}r.

The derivative vanishes when 4πr−2V0/r2=04\pi r-2V_0/r^2=0, or r3=V0/(2π)r^3=V_0/(2\pi). At this radius, the constraint gives h=2rh=2r. Because S′′=4π+4V0/r3>0S''=4\pi+4V_0/r^3>0 throughout r>0r>0, the derivative is increasing and the stationary point is a global minimum. Also S→∞S\to\infty as r→0+r\to0^+ or r→∞r\to\infty, ruling out an escaped finite boundary optimum. EVT alone cannot be invoked on the open unbounded domain.

The model assumes the same material cost per unit area for the side and both ends, negligible thickness, and no seam allowance. Different manufacturing costs alter the objective and may alter the optimum.

Sensitivity and discrete decisions

A continuous optimum can guide a decision constrained to integer quantities, but rounding must respect the feasible set. Evaluate neighboring feasible integers, not just the nearest decimal in isolation. If an objective is unimodal, those nearby candidates often suffice; justify that structure before excluding distant alternatives.

Dimensions and parameters also matter. For fencing length PP, the wall problem gives x=P/4x=P/4, y=P/2y=P/2, and maximum area P2/8P^2/8. Doubling available fencing quadruples the maximum area in this model. A parameterized result conveys more than one isolated numerical answer.

Exercises

  1. Maximize the area of a four-sided rectangle with perimeter 8080 metres.
  2. Repeat the three-sided wall problem for fencing length P>0P>0.
  3. For a square sheet of side L>0L>0, determine the cut that maximizes the open-box volume.
  4. A cylinder must have volume 16π16\pi cubic centimetres. Find the minimum-area radius and height.
  5. Explain why finding A′(x)=0A'(x)=0 does not by itself prove an absolute maximum.
  6. Identify an assumption that would change the cylinder’s objective without changing its volume constraint.
Worked solutions
  1. Write A=x(40−x)A=x(40-x) on [0,40][0,40]. The maximum is 400400 square metres at x=y=20x=y=20.
  2. A=x(P−2x)A=x(P-2x); its stationary point is P/4P/4, giving y=P/2y=P/2 and area P2/8P^2/8. Endpoint areas vanish.
  3. V=x(L−2x)2V=x(L-2x)^2 on [0,L/2][0,L/2], with derivative (L−2x)(L−6x)(L-2x)(L-6x). The maximum occurs at x=L/6x=L/6, giving volume 2L3/272L^3/27.
  4. r3=16π/(2π)=8r^3=16\pi/(2\pi)=8, so r=2r=2 and h=4h=4 centimetres.
  5. Stationary points can be minima or neither; boundaries, nondifferentiable points, and nonattainment must be checked.
  6. More expensive end material, seam allowance, a missing lid, or thickness-dependent costs would change the surface-cost expression.