Gurobi’s outstanding performance has been demonstrated through leadership in public benchmark tests and dramatic improvement in solve times year after year. Built from the ground up using the latest developments & techniques, Gurobi’s extremely robust code ensures numerical stability, correctness of results, and scalability.
Developer: Gurobi Optimization, Inc.
Current version: 6.0
Problem types supported: Linear and convex quadratic optimization in continuous and integer variables.
Special forms detected: Convex quadratic expressions in objectives and constraints; conic quadratic constraints.
Algorithms available: For continuous problems, primal and dual simplex, interior-point (barrier); for integer problems, advanced branch-and-bound with presolve, feasibility heuristics and cut generators.
Special features: Shared-memory parallel processing for barrier, branch-and-bound. Distributed concurrent optimization and tuning to leverage multiple machines. Gurobi Compute Server for enhanced reliability and load balancing. Special facilities for infeasibility diagnosis.