171
C H A P T E R 5
Optimization
In this chapter we will start on optimization, the process of finding the largest or smallest value
a function can take on as well as values that are larger (or smaller) than all nearby values. is
chapter only lets us optimize functions of one independent variable, but it sets the stage for more
complex types of optimization later in the series.
5.1 OPTIMIZATION WITH DERIVATIVES
As is often the case, our first step is to define our terms. We need terminology to sort out
different types of maximum and minimum value.
Definition 5.1 If a function f .x/ is defined on an interval or collection of intervals I, then the
global maximum of f .x/ is the largest value f .x/ takes on anywhere on I.
Definition 5.2 If a function f .x/ is defined on an interval or collection of intervals I, then the
global minimum of f .x/ is the smallest value f .x/ takes on anywhere on I.
Definition 5.3 If a function f .x/ is defined near and including x D c and, in some interval
I D .c ı; c C ı/, we have that, for all a 2 I , f .c/ f .a/, then we say f .x/ has a local
maximum at x D c.
Definition 5.4 If a function f .x/ is defined near and including x D c and, in some interval
I D .c ı; c C ı/, we have that, for all a 2 I , f .c/ f .a/, then we say f .x/ has a local
minimum
at
x
D
c
.
We use the term optima for values that are maxima or minima. Figure 5.1 demonstrates the
different sorts of optima.
e key to finding optima is the behavior of the derivative. Notice that, at an optimum, the
function changes between increasing and decreasing. is means that optima, at least ones that
don’t occur at the beginning and end of an interval, are a kind of point we’ve seen before: they