Solvers

Mathematical Programming Solvers

AIMMS provides links to many powerful 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.

Solvers Description
OSI AIMMS Open Solver Interface, link solvers through a collection of C++ interfaces
AOA Open source AIMMS Outer Approximation module for solving mixed integer nonlinear programming
BARON Branch-And-Reduce Optimization Navigator for Global Optimization
COIN-OR Linear Programming / Mixed Integer Programming solver (CBC) and Interior Point Optimizer for large-scale nonlinear Optimization (IPOPT)
CONOPT Large scale nonlinear programming solver from Arki Consulting
CPLEX High performance Linear Programming / Mixed Integer Programming solver from IBM ILOG
CP Optimizer State-of-the-art Constraint Programming solver from IBM ILOG
GUROBI High performance Linear Programming / Mixed Integer Programming 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 Linear Programming / Mixed Integer Programming solver with interior point algorithm from MOSEK
PATH Newton-based solver for solving Mixed Complementarity Programming
SNOPT Nonlinear Programming Solver from Stanford University
XA Linear Programming / Mixed Integer Programming Solver from Sunset Software Technology

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.