All Solvers for AMPL

Linear (simplex): Linear objective and constraints, by some version of the simplex method.

Linear (interior): Linear objective and constraints, by some version of an interior (or barrier) method.

Network: Linear objective and network flow constraints, by some version of the network simplex method.

Quadratic: Convex or concave quadratic objective and linear constraints, by either a simplex type or interior-type method.

Nonlinear: Continuous but not all-linear objective and constraints, by any of several methods including reduced gradient, quasi-newton, augmented lagrangian and interior-point. Unless other indication is given (see below), possibly optimal over only some local neighborhood.

Nonlinear convex: Nonlinear with an objective that is convex (if minimized) or concave (if maximized) and constraints that define a convex region. Guaranteed to be optimal over the entire feasible region.

Nonlinear global: Nonlinear but requiring a solution that is optimal over all points in the feasible region.

Complementarity: Linear or nonlinear as above, with  additional complementarity conditions.

Integer linear: Linear objective and constraints and some or all integer-valued variables, by a branch-and-bound approach that applies a linear solver to successive subproblems.

Integer nonlinear: Continuous but not all-linear objective and constraints and some or all integer- valued variables, by a branch-and-bound approach that applies a nonlinear solver to successive subproblems.

Sources of further information for obtaining and using the solver. This entry may be a link to a developer’s or vendor’s web site, or (where indicated) to a site from which the solver and documentation can be downloaded.

Where available, a link to a directory in www.netlib.org/ampl/solvers from which you can download C source code to make an AMPL-= enabled version of the solver.

Links to instructions for accessing the solver and solver options from within the AMPL environment.