AIMMS - Solvers and Supported Mathematical Programming Types

If you would like to extend the power of AIMMS (beyond the open source COIN-OR solvers and AOA algorithm) with commercial solvers, we offer you the possibility to add commercial solvers to AIMMS. If you already have a license for one of the available additional solvers (in the form of a callable library), you can also request a Solver Link and use your existing solver license with AIMMS.

Solver Options	LP	MIP	QP	MIQP	QCP	MIQCP	NLP	MINLP	MCP	MPCC	GO
CBC (COIN-OR)	√	√
IPOPT (COIN-OR)	√		√		√		√
AOA (Algorithm)				√		√		√
Commercial Solvers:
CONOPT	√		√		√		√
CPLEX^	√	√	√	√	√	√
GUROBI^	√	√
MOSEK^	√	√	√	√	√	√	√#
XA	√	√	√
XPRESS	√	√	√	√
PATH									√
SNOPT	√		√				√
MINOS	√		√				√
KNITRO	√		√				√	√	√	√
BARON		√	√	√	√	√	√	√			√
LGO							√				√
^: CPLEX (as of version 12), GUROBI and MOSEK include the use of parallel threads #: MOSEK only handles convex NLP

Compare LP/MIP solvers

A tabular overview of the available features and differences of the LP/MIP solvers CPLEX, GUROBI, XA, MOSEK, XPRESS, and CBC are available here.