A list of the Gurobi examples#
We recommend that you begin by reading the overview of the examples
(which begins in the next section). However,
if you’d like to dive directly into a specific example, the following is
a list of all of the examples included in the Gurobi distribution,
organized by basic function. The source for the examples can be found by
following the provided links, or in the examples directory of the
Gurobi distribution.
Read a model from a file#
Example |
Description |
Available Languages |
|---|---|---|
A very simple example that reads a continuous model from a file, optimizes it, and writes the solution to a file. If the model is infeasible, it writes an Irreducible Inconsistent Subsystem (IIS) instead. |
||
Reads a MIP model from a file, optimizes it, and then solves the fixed version of the MIP model. |
Build a simple model#
Example |
Description |
Available Languages |
|---|---|---|
Builds a trivial MIP model, solves it, and prints the solution. |
||
Builds a trivial QP model, solves it, converts it to an MIQP model, and solves it again. |
||
Builds and solves a trivial QCP model. |
||
Builds and solves a trivial bilinear model. |
||
Builds and solves a trivial SOS model. |
||
Solves a model stored using dense matrices. We don’t recommend using dense matrices, but this example may be helpful if your data is already in this format. |
||
Demonstrates the use of simple general constraints. |
||
A Python-only example that formulates and solves a simple MIP model using the matrix API. |
||
Demonstrates the use of multi-objective optimization. |
||
Demonstrates the use of piecewise-linear objective functions. |
||
Demonstrates the use of piecewise-linear constraint. |
||
Demonstrates the use of function constraints. |
||
Builds and solves a simple nonlinear model. |
||
Demonstrates the use of solution pools. |
A few simple applications#
Example |
Description |
Available Languages |
|---|---|---|
Builds and solves the classic diet problem. Demonstrates model construction and simple model modification - after the initial model is solved, a constraint is added to limit the number of dairy servings. |
||
Python-only variants of the diet example that illustrate model-data separation. |
||
Simple facility location model: given a set of plants and a set of warehouses, with transportation costs between them, this example finds the least expensive set of plants to open in order to satisfy product demand. This example demonstrates the use of MIP starts —- the example computes an initial, heuristic solution and passes that solution to the MIP solver. |
||
Python-only example that solves the n-queens problem using the matrix-oriented Python interface. |
||
A Python-only example that solves a multi-commodity network flow model. It demonstrates the use of several Python modeling constructs, including dictionaries, tuples, tupledict, and tuplelist objects. |
||
A Python-only example that solves a financial portfolio optimization model, where the historical return data is stored using the pandas package and the result is plotted using the matplotlib package. It demonstrates the use of pandas, NumPy, and Matplotlib in conjunction with Gurobi. |
||
Reads a Sudoku puzzle data set from a file, builds a MIP model to solve that model, solves it, and prints the solution. |
||
Formulates and solves a workforce scheduling model. If the model is infeasible, the example computes and prints an Irreducible Inconsistent Subsystem (IIS). |
||
An enhancement of workforce1. This example solves the same workforce scheduling model, but if the model is infeasible, it computes an IIS, removes one of the associated constraints from the model, and re-solves. This process is repeated until the model becomes feasible. Demonstrates constraint removal. |
||
A different enhancement of workforce1. This example solves the same workforce scheduling model, but if the model is infeasible, it adds artificial variables to each constraint and minimizes the sum of the artificial variables. This corresponds to finding the minimum total change in the right-hand side vector required in order to make the model feasible. Demonstrates variable addition. |
||
An enhancement of workforce3. This example solves the same workforce scheduling model, but it starts with artificial variables in each constraint. It first minimizes the sum of the artificial variables. Then, it introduces a new quadratic objective to balance the workload among the workers. Demonstrates optimization with multiple objective functions. |
||
An alternative enhancement of workforce3. This example solves the same workforce scheduling model, but it starts with artificial variables in each constraint. It formulates a multi-objective model where the primary objective is to minimize the sum of the artificial variables (uncovered shifts), and the secondary objective is to minimize the maximum difference in the number of shifts worked between any pair of workers. Demonstrates multi-objective optimization. |
Illustrating specific features#
Example |
Description |
Available Languages |
|---|---|---|
Reads a MIP model from a file, adds artificial slack variables to relax each constraint, and then minimizes the sum of the artificial variables. It then computes the same relaxation using the feasibility relaxation feature. The example demonstrates simple model modification by adding slack variables. It also demonstrates the feasibility relaxation feature. |
||
Demonstrates the use of different LP algorithms. Reads a continuous model from a file and solves it using multiple algorithms, reporting which is the quickest for that model. |
||
Demonstrates the use of advanced starts in LP. Reads a continuous model from a file, solves it, and then modifies one variable bound. The resulting model is then solved in two different ways: starting from the solution of the original model, or restarting from scratch. |
||
Demonstrates the use of Gurobi parameters. Reads a MIP model from a file, and then spends 5 seconds solving the model with each of four different values of the MIPFocus parameter. It compares the optimality gaps for the four different runs, and continues with the MIPFocus value that produced the smallest gap. |
||
MIP sensitivity analysis. Reads a MIP model, solves it, and then computes the objective impact of fixing each binary variable in the model to 0 or 1. Demonstrates the multi-scenario feature. |
||
Uses the parameter tuning tool to search for improved parameter settings for a model. |
||
Implements a simple MIP heuristic. It reads a MIP model from a file, relaxes the integrality conditions, and then solves the relaxation. It then chooses a set of integer variables that take integer or nearly integer values in the relaxation, fixes them to the nearest integer, and solves the relaxation again. This process is repeated until the relaxation is either integer feasible or linearly infeasible. The example demonstrates different types of model modification (relaxing integrality conditions, changing variable bounds, etc.). |
||
Simple facility location model: given a set of plants and a set of warehouses, with transportation costs between them, this example finds the least expensive set of plants to open in order to satisfy product demand. Since the plant fixed costs and the warehouse demands are uncertain, multiple scenarios are created to capture different possible values. A multi-scenario model is constructed and solved, and the solutions for the different scenarios are retrieved and displayed. |
||
Demonstrates the use of batch optimization. |
||
Example which formulates a workforce scheduling model. The model is solved using batch optimization. The VTag attribute is used to identify the set of variables whose solution information is needed to construct the schedule. |
||
Example that shows the use of context managers to create and dispose of environment and model objects. |