Solving Optimization Problems

Absolute extrema

An optimization problem asks for the largest or smallest value of a quantity over every allowed input: an absolute extremum. A relative extremum isn't enough. In the graph below, ff has a relative maximum at x=2x = 2, and yet f(7)f(7) is larger.
On [0, 7], f has a relative maximum at x = 2, but its absolute maximum is f(7) = 7.7, at an endpoint. Its absolute minimum, f(0) = 0, is at the other endpoint.
Critical points, where the derivative is 00 or undefined, are the candidates. One of two arguments then shows which candidate gives the absolute extremum.
The lesson on the Second Derivative Test proves this. A second point where ff beats f(c)f(c) would force a second critical point between them.

A closed domain

An optimum at an endpoint

A limit on the variable can shut the critical point out of the domain. When no critical point lies inside a closed domain, the Candidates Test compares the endpoints alone, and the optimum is at one of them.

An unbounded domain

A domain such as t≥0t \ge 0 has no right endpoint, so the Candidates Test doesn't apply. The one-critical-point argument still works there, with the First Derivative Test or the Second.