Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
AMPL
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Solvers== Here is a partial list of [[solver]]s supported by AMPL:<ref>{{cite web|url=http://www.ampl.com/solvers.html|title=Solvers - AMPL|access-date=21 January 2018|archive-date=27 February 2014|archive-url=https://web.archive.org/web/20140227083015/http://www.ampl.com/solvers.html|url-status=dead}}</ref> {| class="wikitable sortable" |- ! width=20%| Solver ! width=80%| Supported problem types |- ! [[APOPT]] | mixed integer [[nonlinear programming]] |- ! [[Artelys Knitro]] | linear, quadratic and nonlinear programming |- ! Bonmin | mixed integer [[nonlinear programming]] |- ! BPMPD | [[Linear programming|linear]] and [[quadratic programming]] |- ! [[COIN-OR]] CBC | [[Linear programming#Integer unknowns|mixed integer programming]] |- ! [[COIN-OR#CLP|COIN-OR CLP]] | linear programming |- ! CONOPT | nonlinear programming |- ! [[Couenne]]<ref>{{cite web|url=https://projects.coin-or.org/Couenne |title=Couenne |access-date=2013-10-27 |url-status=dead |archive-url=https://web.archive.org/web/20131029190415/https://projects.coin-or.org/Couenne |archive-date=2013-10-29 }}</ref> | mixed integer nonlinear programming (MINLP) |- ! [[CPLEX]] | linear, quadratic, [[Second-order cone programming|second-order cone]] and mixed integer programming |- ! CPLEX CP Optimizer<ref>{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/ilogcp|title=mp/solvers/ilogcp at master 路 ampl/mp 路 GitHub|work=GitHub|access-date=11 August 2015}}</ref> | [[constraint programming]] |- ! FILTER | nonlinear programming |- ! [[FortMP]] | linear, quadratic and mixed integer programming |- ! [[Gecode]]<ref>{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/gecode|title=mp/solvers/gecode at master 路 ampl/mp 路 GitHub|work=GitHub|access-date=11 August 2015}}</ref> | constraint programming |- ! [[IPOPT]] | nonlinear programming |- ! [[JaCoP (solver)|JaCoP]]<ref>{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/jacop|title=mp/solvers/jacop at master 路 ampl/mp 路 GitHub|work=GitHub|access-date=11 August 2015}}</ref> | constraint programming |- ! LGO<ref>{{cite web|url=http://ampl.com/products/solvers/solvers-we-sell/lgo/|title=LGO - AMPL|access-date=11 August 2015}}</ref> | global and local nonlinear optimization |- ! lp_solve<ref>{{cite web|url=http://www.ampl.com/SOLVERS/GUIDE.lpsolve.html|title=Using lpsolve from AMPL|access-date=11 August 2015}}</ref> | linear and mixed integer programming |- ! [[MINOS (optimization software)|MINOS]] | linear and nonlinear programming |- ! [[MINTO]] | mixed integer programming |- ! [[MOSEK]] | linear, mixed integer linear, quadratic, mixed integer quadratic, [[Quadratically constrained quadratic program|quadratically constrained]], conic and convex nonlinear programming |- ! [[Octeract Engine]] | All types of optimisation problems without differential or integral terms, including discontinuous problems with {{math|min}} and {{math|max}} elementary functions. |- ! [[SCIP (optimization software)|SCIP]] | mixed integer programming |- ! [[SNOPT]] | nonlinear programming |- ! Sulum<ref>{{cite web|url=https://github.com/ampl/mp/tree/master/solvers/sulum|title=mp/solvers/sulum at master 路 ampl/mp 路 GitHub|work=GitHub|access-date=11 August 2015}}</ref> | linear and mixed integer programming |- ! [[WORHP]] | nonlinear programming |- ! XA | linear and mixed integer programming |- ! [[FICO Xpress|Xpress]] | linear and convex [[Quadratically constrained quadratic program|quadratic optimization]] and their mixed integer counterparts |}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)