the variables one at a time. This scheme can often be interpreted as a list of priorities, and those
priorities reveal the economic forces at work.
The pattern that emerges from the economic priorities is essentially a qualitative one, in
that we can describe it without using specific numbers. However, once we supply the parameters
of the constraints, the pattern leads us to the optimal quantitative solution. In a sense, it is almost
as if Solver first spots the optimal pattern and then says, “Give me the numerical information in
your problem.” For any specification of the numbers (within certain limits), Solver could then
compute the optimal solution by simply following the sequential steps in the pattern’s compu-
tational scheme. In reality, of course, Solver cannot know the pattern until the solution is deter-
mined, because the solution is a critical ingredient in the pattern.
Two diagnostic questions help determine whether we have been successful at extracting a
pattern: Is the pattern complete? Is it unambiguous? That is, the pattern must lead us to a full
solution of the problem, not just to a partial solution, and it must lead to a unique determination
of the variables. As a check on our specification of the pattern, we can derive shadow prices. In
each case, the shadow price comes from altering one constraint constant in the original problem.
We should be able to trace the incremental changes in the variables, through the various steps in
the pattern’s computational scheme, and ultimately derive the shadow price for the correspond-
ing constraint. We can also determine marginal values for changing several parameters at a time
in much the same way, and we can compute the allowable range over which these marginal
values continue to hold.
Unfortunately, it is not always the case that the pattern can be reduced to a list of assign-
ments in priority order. Occasionally, after we identify the positive variables and the binding
constraints in the optimal solution, we might be able to say no more than that the pattern
comes from solving a system of simultaneous equations determined by those constraints and
those variables. Nevertheless, in most cases, as the examples demonstrate, focusing on the pat-
tern can provide added insight beyond the numbers.
Patterns have certain limits, as suggested above. If we think of testing our specification of a
pattern by deriving shadow prices, we have to recognize that a shadow price has a limited range
over which it holds, as indicated by its allowable increase and allowable decrease. Beyond this
range, a different pattern prevails. As we change a constraint constant, the shadow price will
eventually change. The same is true of the pattern: Beyond the range in which the shadow
price holds, the pattern may change. In the product portfolio example, however, we were able
to specify the computational scheme in a general way, so that it holds even when the shadow
price changes. In that example, we were able to articulate the pattern at a high enough level
of generality that the qualitative “story” continues to hold even for substantial changes in the
given data.
EXERCISES
4.1. Transportation Patterns Revisited Revisit the transportation model of this chapter
and the pattern in its optimal solution.
(a) Suppose that Atlanta demand is increased by 100 units. Use the pattern to determine
the impact of this increase on the optimal total cost. What is the cost increase per unit
increase in demand at Atlanta? For how much of an increase in Atlanta demand will
this marginal cost continue to hold? Use the information in the Sensitivity Report to
confirm your results.
160 Chapter 4 Sensitivity Analysis in Linear Programs