Gurobi Optimization Gurobi 4.5.1 | 7.43 MB
The Gurobi Optimizer is a state-of-the-art solver for linear programming (LP), quadratic programming (QP) and mixed-integer programming (MILP and MIQP). It was designed from the ground up to exploit modern multi-core processors.
For solving LP and QP models, the Gurobi Optimizer includes high-performance implementations of the primal simplex method, the dual simplex method, and a parallel barrier solver. For MILP and MIQP models, the Gurobi Optimizer incorporates the latest methods including cutting planes and powerful solution heuristics. All models benefit from advanced presolve methods to simplify models and slash solve times.
Every Gurobi license allows parallel processing, and the Gurobi Parallel Optimizer is deterministic: two separate runs on the same model will produce identical solution paths.
The Gurobi Optimizer is written in C and is accessible from several languages. In addition to a powerful, interactive Python interface and a matrix-oriented C interface, we provide object-oriented interfaces from C++, Java, Python, and the .NET languages. These interfaces have all been designed to be lightweight and easy to use, with the goal of greatly enhancing the accessibility of our products. And since the interfaces are lightweight, they are faster and use less memory than other standard interfaces. Our online documentation (Quick Start Guide, Example Tour and Reference Manual) describes the use of these interfaces.
Home Page - http://www.gurobi.com