E-mail this page
Request WebMeeting
GUROBI Solver for Linear and Mixed Integer Programming
Gurobi is a state-of-the-art simplex-based linear programming (LP) and mixed integer programming (MIP) solver.
The GUROBI Mixed Integer Programming solver allows for shared memory parallelism, and thus is capable of simultaneously exploiting any number of processors and cores per processor. Its implementation is deterministic and thus two separate runs on the same model will produce identical solution paths.
GUROBI 3.0 includes a parallel barrier optimizer for linear problems. In future versions, the GUROBI solver also plans to support:
- Simplex QP (quadratic programming)
- Barrier-based QP, and SOCP (second order cone programming) solvers
- MIQP (mixed-integer QP) and Mixed Integer Quadratic Constraint Programming (mixed-integer SOCP) solvers
Download a free license to try GUROBI as the Mathematical Programming solver in AIMMS
About Gurobi
GUROBI is developed and supported by GUROBI Optimization, Inc. a company founded in 2008 by Robert Bixby, Zonghao Gu and Edward Rothberg.
Website:
http://www.gurobi.com
GUROBI Requirements
Gurobi requires that the computer's CPU supports SSE2. Most modern computers support SSE2 (SSE2 was introduced by Intel in 2001 and by AMD in 2003).
GUROBI Supported Versions
AIMMS supports Gurobi 1.0, 1.1, 2.0 and 3.0.
Download a free license to try GUROBI as the Mathematical Programming solver in AIMMS
