Professional Documents
Culture Documents
SydsaeterHammondMathematicsforEconomicAnalysis PDF
SydsaeterHammondMathematicsforEconomicAnalysis PDF
0 by
(for n = 1,2
(+)
a(x) = (145)" (risa positive constant)
x
Show that
P
THB
s@) =2@) [a (+)-
(Use logarithmic differentiation.) Put h(u) = In(1 +u) — u/(1 +u). Then
(0) = 0. Show that 4’(u) > 0 for u > 0, and hence that g'(x) > 0 for all
x > 0. What conclusion can you draw?—9
Single- Variable
Optimization
If you want literal realism, look at the world around
‘you; if you want understanding, look at theories.
—R. Dorfman (1964)
Looking for the best way of pursuing a certain goal involves what are called
optimization problems. Examples can be drawn from almost all areas of human
activity. A manager seeks those combinations of inputs (such as capital and labor)
that maximize profits or minimize costs. A doctor might want to know when
the concentration of a drug in the bloodstream is at its greatest. A farmer might
want to know what amount of fertilizer per square yard will maximize profits.
An oil company may wish to find the optimal rate of extraction from one of its
wells.
Studying an optimization problem of this sort using mathematical methods
requires us to construct @ mathematical model for the problem. This is usually
not easy, and only in simple cases will the model lead to the problem of max-
imizing or minimizing a function of a single variable—the main topic of this
chapter.
In general, no mathematical methods have more important applications in
economics than those designed 10 solve optimization problems. Though economic
optimization problems usually involve several variables, the examples of quadratic
optimization in Section 3.2 indicate how useful economic insights can be gained
even from simple one-variable optimization.
282e Sec. 8.1 / Some Basic Definitions 283
9.1 Some Basic Definitions
Recall from Section 7.2 that, if f(x) has domain D. then
c € Disa maximum point for f <= f(x) < f(c), forallx€D (9.1)
d Disa minimum point for f => f(x) > f(@), forall xe D [9.2]
In [9.1], we call f(c) the maximum value, and in [9.2], we call f(d) the minimum
value. If the value of f at c is strictly larger than at any other point in D, then c
is a strict maximum point. Similarly, @ is a striet minimum point if f(x) > f(@)
for all x € D, x #d. As collective names. we use optimal points and values, ot
extreme points and values.
If f is any function with domain D, then ~f is defined in D by (— f)(x) =
—f(x). Note that f(x) < f(c) for all x € D, if and only if —f(x) > —f(0)
for all x € D. Thus, c maximizes f in D if and only if c minimizes —f in D.
This simple observation, which is illustrated in Fig. 9.1, can be used to convert
maximization problems to minimization problems and vice versa.
Our main task in this chapter is to study how to determine the possible
maximum ané minimum points of a function. In this connection, the following
definition is crucial:
Xo is a stationary point for f if f’(xo) = 0 (93)
Geometrically, stationary points occur where the tangent to the graph of the function
is parallel to the x-axis.
Before starting to explore systematically the properties of maxima and min-
ima, we provide some geometric examples based on the graph of the function.
They will indicate for us the role played by the stationary points of a function in
the theory of optimization.
FIGURE 9.1 Point c is a maximum point for f(x) and a minimum point for —f(x).284 chapter 9 / Single-Varable Optimization
|
FIGURE 9.2 FIGURE 9.3
ee
Tae
FIGURE 9.4
Figure 9.2 is the graph of a function f having two stationary points, ¢ and
d. Ate, there is a maximum; at d, there is a minimum.
In Fig. 9.3, the function has no stationary points. There is a maximum at the
end point b and a minimum at d. At d, the function is not differentiable. At b,
the derivative (the left-hand derivative) is not 0.
Finally, the function f whose graph is shown in Fig. 9.4 has three stationary
points, x9, xj, and x2. At end point a, there is a minimum, whereas f does not
have any maximum value because it approaches oo as x tends to b. At the critical
point xo, function f has a local maximum in the sense that its value at that point
is higher than at ail neighboring points. Similarly, at x), it has a local minimum,
whereas at x2 there is a stationary point that is neither a local maximum nor a local
‘minimum. We call x2 an inflection point.
The three figures represent the most important properties of single-variable
optimization problems. Becausé the theory is so important in practical applications,
we must not simply rely on geometric insights, but must rather develop a firmer
analytical foundation for optimization theory.
9.2 A First-Derivative Test for Extreme Points
In many important cases. we can find maximum or minimum values for a function
just by studying the sign of its first derivative. Suppose f(x) is differentiable
fon an interval J and suppose f(x) has only one stationary point. x = c. IfSec. 9.2 / A First-Derwative Test for Extreme Points 285
1
= x
FIGURE 9.5 Point x = cis a FIGURE 9.6 Point x = dis a
‘maximum point. minimum point.
F(z) = 0 for all x €./ such that x < c, whereas f'(x) < 0 for all x € J
such that x > c, then f(x) is increasing to the left of ¢ and decreasing to the
right of c. It follows that f(x) < f(c) for all x < ¢ and f(c) = f(x) for
all x > c, Hence, x = c is a maximum point for f in J, as illustrated in
Fig. 9.5.
With obvious modification, a similar result holds for minimum points, as
illustrated in Fig. 9.6. Briefly stated:!
A First-Derivative Test for Max/Min
If f(x) 2 0 for x sc, and f'(x) <0 for x > ¢, then x =c is a maximum
point for f. [9.4]
If f(x) <0 for x