AIMMS - Nonlinear Programming

Nonlinear Programming

Nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized, where some of the constraints or the objective function are nonlinear. Nonlinear programming problems are in general more difficult to solve than linear programming problems, and often the solution found is only a local optimum. The solution methods for nonlinear programming models vary, which can result in different solvers giving different local optima for the same problem.

Benefits of Using AIMMS as Nonlinear Programming Software

Besides the general benefits of using AIMMS, there is some specific functionality that makes AIMMS an excellent tool for modeling nonlinear programming problems. For example, AIMMS is equipped with a nonlinear presolver. With a presolve, nonlinear problems can be solved faster and the solution can improve. The solver may even find a feasible solution for problems declared infeasible without the presolve, and in other cases provide proof that it really is infeasible. AIMMS also comes with an open customizable multi-start algorithm which may increase the chance of finding a good final solution. AIMMS contains an efficient implementation of Hessian calculation which can speed up the solution process of some NLP solvers. As the performance of the various available NLP solvers depends heavily on the specific problem, AIMMS makes it very easy to find the best solver for your specific problem by supporting links to many solvers.

For a full description of the nonlinear presolver and the multi-start algorithm see Chapter 17 in the Language Reference.

Teaching

AIMMS comes with an Optimization Modeling Guide in PDF format. This book contains a general introduction on modeling and various examples. The combination of AIMMS (with Free Student License) and this book are ideal for teaching nonlinear programming courses and learning about nonlinear programming through self-study.

Nonlinear Programming solvers

Standard Solvers

AIMMS supports the solvers CONOPT, SNOPT, MINOS, and KNITRO, to solve nonlinear programming models. AIMMS also supports the global optimization (GO) solvers LGO and BARON, which can find global optima for a certain subset of nonlinear programming problems, while the other solvers only guarantee local optima.

Open Solver Interface

The AIMMS Open Solver Interface allows solver developers to link their own nonlinear programming solvers to AIMMS themselves.

Nonlinear Programming Application Examples

Free Trial License

Download a free trial license of AIMMS to experience the benefits of using AIMMS as your nonlinear programming software.

Read on: