
global optimum in general. Solver’s MultiStart option is often a powerful feature in trying to
solve problems with several local optima, but it does not provide any guarantees, either.
Another limitation concerns integer-valued variables. The presence of integer constraints
in an otherwise nonlinear model generally leaves us in a situation where the nonlinear solver
may fail to find a global optimum, even to a relaxed problem that is encountered during
Solver’s implementation of branch and bound. This feature renders the GRG algorithm unreli-
able (in the sense of producing a guaranteed global optimum), and the implication is that we
should avoid trying to solve integer nonlinear programming problems with Solver.
Fortunately, in some practical cases, we can transform the most natural formulation into a
linear model. With the transformation, an integer-valued problem can be solved reliably with
the linear solver augmented by the branch and bound procedure. For models that contain
Excel’s MAX, ABS, or IF functions, Solver’s Nonsmooth Model Transformation option can
often provide the linear equivalent of a nonsmooth formulation, although the details of the
model it builds remain opaque.
Finally, because the nonlinear solver is applicable to such a wide variety of optimization
problems (and therefore must accommodate exponents, products, and special functions) we
know of no standard layout that conveniently captures the necessary calculations in the context
of spreadsheets. This feature stands in contrast to the use of the linear solver, where one standard
layout could, in principle, always be used. (Nevertheless, as we have seen in Chapters 3–6, there
are sometimes good reasons for using a few non-standard variations.) The most useful guideline,
as with all spreadsheet models, still seems to be to modularize the spreadsheet and thereby sep-
arate objective function, decision variables, and constraints.
EXERCISES
8.1. Merrill Sporting Goods (Revisited) Revisit Example 8.4, in which the criterion gives
equal weight to each of the retail sites. But in practice, there will be different levels of traf-
fic between the warehouse and the various sites. One way to incorporate this consideration
Table 8.1. Comparison of the Linear and Nonlinear Algorithms
Linear solver Nonlinear solver
Suitable for linear models Suitable for nonlinear models;
can also solve most linear models.
Finds a global optimum each time Finds a local optimum each time.
No guarantee of global optimum,
except in special circumstances.
Ignores initial decision variables Uses initial decision variables in search;
result may depend on starting values.
Finds a feasible solution if one exists May not be able to find a feasible
solution when one exists.
Always leads to an optimum, unless
problem is infeasible or unbounded
May generate “convergence” message;
a re-run may be necessary.
Comprehensive sensitivity information
from the Sensitivity Report
Sensitivity Report does not include
allowable ranges.
328 Chapter 8 Nonlinear Programming