E-mail this page
Request WebMeeting
Solvers
AIMMS provides links to many commercially available solvers that allow you to solve problems of all major mathematical programming types such as linear programming, mixed integer programming and nonlinear programming. For a table with all available solvers and their mathematical programming types click here.
The availability of different solvers for each mathematical programming type make it easy to compare performance and switch to a different solver when necessary.
Besides the availability of solvers, AIMMS also offers an open solver interface that allows you to link your own solver to AIMMS.
Please contact us in case you need any assistance in determining which solver is most suitable for your application.
Available Solvers & Solver Links in AIMMS
| Solvers | Description |
| AOA | Open Source Outer Approximation Implementation for MINLP |
| BARON | Branch-And-Reduce Optimization Navigator for Global Optimization |
| CONOPT | Large scale nonlinear programming solver from Arki Consulting |
| CPLEX | High performance LP/MIP solver from ILOG |
| GUROBI | High performance LP/MIP solver from Gurobi Optimization |
| KNITRO | Nonlinear programming solver from Ziena Optimization |
| LGO | Lipschitz-continuous Global Optimizer from Pinter Consulting Services |
| MINOS | Nonlinear programming solver from Stanford University |
| MOSEK | LP/MIP solver with interior point algorithm |
| PATH | Newton-based solver for solving Mixed Complementarity Programming |
| SNOPT | Nonlinear Programming Solver |
| SPPPlus | Set Partitioning Problem Solver |
| XA | LP/MIP Solver from Sunset Software Technology |
| XPRESS | High performance LP/MIP Solver from Dash Optimization |
