P2 7.1 - Optimisation in context
Turn a practical constraint into a function of one variable, then use differentiation to find and justify an optimum. Keep the physical domain, allowed endpoints and requested quantity in view so that a stationary input becomes a useful answer.
Building a function with a domain
How should you shape an open box to hold a fixed volume using the least material? A wide base uses more material underneath but needs shorter walls. Calculus can balance those competing effects once the model has only one independent variable.
Start with a simpler trade-off: a rectangle whose perimeter is fixed. Write the quantity to optimise first, then use the constraint to remove the second variable.
Objective function and domain
An objective function is the quantity to maximise or minimise, expressed in terms of an input. Its domain is the set of allowed inputs. A physical length must be positive; any further restrictions in the question also belong in the domain.
Draw or list the actual sides or faces before forming a formula. A volume constraint and a surface-area objective measure different things: one cannot replace the other.
Worked example 1: a fixed perimeter
Question. A rectangle has perimeter and side lengths and . Express its area in terms of , with the domain for a nondegenerate rectangle.
Plan. Use the perimeter equation to eliminate from .
Both sides must be positive: and .
Answer. square metres, for .
Check. At , : the perimeter is and the area is , also given by .
Change only which sides need fencing: a straight river supplies one side, so the same of fencing now covers three sides.
Worked example 2: one side supplied by a river
Question. A rectangular enclosure beside a straight river uses of fencing for its two widths and its length . Find its area function and physical domain.
Plan. Count the fenced sides, then eliminate the length from the area formula.
Answer. square metres, for .
Check. At , . The fenced sides total , and .
Endpoints and would collapse an enclosure to zero area; they are excluded from these physical domains. A different problem may explicitly allow endpoints, for example an operating temperature in a closed range.
Watch out
Do not use for the river enclosure. The constraint must count the sides actually present in the question.
Build the same three-side model with a new fence length.
Finding candidates
Differentiation finds possible interior optima; the domain decides which of those candidates are allowed.
For a differentiable function, an interior maximum or minimum must have zero derivative. Thus solve , but retain only solutions in the domain. Allowed endpoints must be considered separately. All the objective functions here are differentiable inside their stated domains.
A denominator is often easiest to differentiate as a negative power. For example, , with derivative .
Worked example 3: a reciprocal term
Question. A surface-area model is , where . Find the stationary input.
Plan. Differentiate as a sum of powers, then clear the denominator in the zero-gradient equation.
Answer. The stationary input is , which is in the domain.
Check. At , the derivative is . Nearby gradients at and are and , consistent with a possible minimum.
Change only the allowed domain. An algebraically correct root can cease to be a candidate for the problem.
Worked example 4: a stationary input outside the domain
Question. The same model is restricted to . Find its stationary candidates in this interval.
Plan. Solve the same derivative equation, then apply the interval restriction.
But .
Answer. There are no stationary candidates in the allowed interval. The endpoints and still need comparison when finding the optimum.
Check. For , and , so . There is no zero derivative in the interval.
Multiplying by was valid because was already excluded. Solving gives , not : .
Watch out
A stationary value of the objective and the input producing it are different answers. Here is an input; is the associated surface area.
Try a new reciprocal coefficient and check the permitted interval.
Checking endpoints and type
A local minimum answers a question about nearby inputs; a global minimum is the least value over the whole allowed domain.
For a continuous function on a closed interval, compare the objective at every stationary input in the interval and at both endpoints. The smallest value is the global minimum; the largest is the global maximum. A second derivative test can classify an interior point, but it does not replace the endpoint comparison.
Worked example 5: an interior minimum and an endpoint maximum
Question. Find the greatest and least values of for .
Plan. Find the stationary input, check its type and compare its value with the endpoint values.
| Candidate | |||
|---|---|---|---|
Answer. Minimum at ; maximum at .
Check. Completing the square gives . The minimum is visibly ; of the allowed endpoints, zero is further from and gives the larger value.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account