Gurobi Optimizer Technical Features and Details

An Optimization Solver Reimagined

The Gurobi Optimizer was designed from the ground up to be the fastest, most powerful solver available for your LP, QP, QCP, and MIP (MILP, MIQP, and MIQCP) problems. Our code was built to fully exploit parallelism. It’s not a sequential code that was parallelized, but a fundamentally parallel code that you can also choose to run sequentially. Our MIP cutting plane routines are second to none. We’ve also gone beyond cutting-edge versions of all the standard cutting planes and developed new classes of cuts available only in Gurobi. Our advanced MIP heuristics for quickly finding feasible solutions often produce good quality solutions where other solvers fall flat. Our barrier algorithms fully exploit the features of the latest computer architectures. And our APIs are designed to be lightweight, modern and intuitive, so as to minimize your learning curve while maximizing your productivity.

Unique Features

We have added a range of capabilities:

• A Python API that provides the advantages of both a modeling language and a full programming language.
• Support for models with multiple, competing objectives and two options to solve them.
• The ability to directly solve models with piecewise-linear objective functions, to better capture certain non-linear problems.
• The ability to express common modeling constructs like min or max or if/then at a higher level, making such models easier to build and maintain,
• Powerful and flexible client-server and cloud capabilities to help you develop and deploy where and how you want to any number of users on a broad range of platforms.