Operations Research Models and Methods / Computation / Mathematical Programming

Nonlinear Programming

For nonlinear programming models some terms of the objective function or constraints involve nonlinear functions of the decision variables. Although the statement of the nonlinear model is similar to the linear programming model, the process of solving such problems is significantly more complicated.

Topic Menu

Example Problem
Specifying Model Characteristics

Constructing the Worksheet

Solving the Problem

Return to Math Programming

The Solver program solves nonlinear programming models, but the nature of the solution obtained usually requires additional analysis. For some problems, the Solver's solution can be identified as the global optimum solution, that is, the solution that maximizes or minimizes the objective function over all feasible solutions. For other problems, the solution obtained can only be identified as a local optimum, that is, a solution better than all feasible points in the close neighborhood of the solution. Because of numerical difficulties associated with the solution procedure, it is even possible that the Solver may fail to find a local optimum solution. We leave these questions to more advanced texts on nonlinear programming. Here we describe the operation of the add-in when the Nonlinear item on the OR_MS menu is selected.


Updated 1/16/01
Operations Research Models and Methods

by Paul A. Jensen and Jon Bard, University of Texas, Copyright by the Authors