Différences
Ci-dessous, les différences entre deux révisions de la page.
| Les deux révisions précédentes Révision précédente Prochaine révision | Révision précédente | ||
| gurobi [2023/07/14 14:41] – [Interactive mode for testing short computation] admin | gurobi [2023/07/17 06:33] (Version actuelle) – supprimée admin | ||
|---|---|---|---|
| Ligne 1: | Ligne 1: | ||
| - | ====== Gurobi Optimizer ====== | ||
| - | ===== Installed version ===== | ||
| - | * 10.0.2 | ||
| - | *Available License : **Academic license - for non-commercial use only** | ||
| - | * You don't need to install or generate your own license file | ||
| - | |||
| - | |||
| - | ===== How to use gurobi ===== | ||
| - | |||
| - | ==== Interactive mode for testing short computation ==== | ||
| - | |||
| - | * Connect to shared node '' | ||
| - | * Always use WORK directory as working area <code bash>$ cd WORK</ | ||
| - | * Load goruby using '' | ||
| - | |||
| - | <WRAP center round important 60%> | ||
| - | * You don't need to setup any license. | ||
| - | * You will use one provided by meso-admins | ||
| - | * Please contact us if you noticed any problem | ||
| - | </ | ||
| - | |||
| - | From now on you can use guroby directly. | ||
| - | |||
| - | Say you need to run this python program : | ||
| - | <file python | ||
| - | # Solve the following MIP: | ||
| - | # maximize | ||
| - | # x + y + 2 z | ||
| - | # subject to | ||
| - | # x + 2 y + 3 z <= 4 | ||
| - | # x + | ||
| - | # x, y, z binary | ||
| - | |||
| - | import gurobipy as gp | ||
| - | |||
| - | # Create a new model | ||
| - | m = gp.Model() | ||
| - | |||
| - | # Create variables | ||
| - | x = m.addVar(vtype=" | ||
| - | y = m.addVar(vtype=" | ||
| - | z = m.addVar(vtype=" | ||
| - | |||
| - | # Set objective function | ||
| - | m.setObjective(x + y + 2 * z, gp.GRB.MAXIMIZE) | ||
| - | |||
| - | # Add constraints | ||
| - | m.addConstr(x + 2 * y + 3 * z <= 4) | ||
| - | m.addConstr(x + y >= 1) | ||
| - | |||
| - | # Solve it! | ||
| - | m.optimize() | ||
| - | |||
| - | print(f" | ||
| - | print(f" | ||
| - | |||
| - | </ | ||
| - | |||
| - | Just run : | ||
| - | <code bash> | ||
| - | $ guroby.sh mip.py | ||
| - | Set parameter WLSAccessID | ||
| - | Set parameter WLSSecret | ||
| - | Set parameter LicenseID to value 2395939 | ||
| - | Academic license - for non-commercial use only - registered to meso-admins@univ-fcomte.fr | ||
| - | Gurobi Optimizer version 10.0.2 build v10.0.2rc0 (linux64) | ||
| - | |||
| - | CPU model: Intel(R) Xeon(R) Platinum 8160 CPU @ 2.10GHz, instruction set [SSE2|AVX|AVX2|AVX512] | ||
| - | Thread count: 96 physical cores, 96 logical processors, using up to 32 threads | ||
| - | |||
| - | Academic license - for non-commercial use only - registered to meso-admins@univ-fcomte.fr | ||
| - | Optimize a model with 2 rows, 3 columns and 5 nonzeros | ||
| - | Model fingerprint: | ||
| - | Variable types: 0 continuous, 3 integer (3 binary) | ||
| - | Coefficient statistics: | ||
| - | Matrix range | ||
| - | Objective range [1e+00, 2e+00] | ||
| - | Bounds range | ||
| - | RHS range [1e+00, 4e+00] | ||
| - | Found heuristic solution: objective 2.0000000 | ||
| - | Presolve removed 2 rows and 3 columns | ||
| - | Presolve time: 0.00s | ||
| - | Presolve: All rows and columns removed | ||
| - | |||
| - | Explored 0 nodes (0 simplex iterations) in 0.01 seconds (0.00 work units) | ||
| - | Thread count was 1 (of 96 available processors) | ||
| - | |||
| - | Solution count 2: 3 2 | ||
| - | |||
| - | Optimal solution found (tolerance 1.00e-04) | ||
| - | Best objective 3.000000000000e+00, | ||
| - | Optimal objective value: 3.0 | ||
| - | Solution values: x=1.0, y=0.0, z=1.0 | ||
| - | </ | ||
| - | ==== Batch mode for long computation==== | ||