Solving the model

Prerequisites

Get the solution

The resulting output

For better understanding we visualized the output below. The NDP is optimal, when New York, Paderborn and Beijing are connected. As well as San Francisco and São Paulo.

By solving the model we generate the following output (using Gurobi): 

Optimizing the Model...
Performing presolve of the model to compute set of removed variables...
Presolve removed 22 rows and 12 columns
Presolve time: 0.00s
Optimizing the Model...
Optimize a model with 22 rows, 12 columns and 48 nonzeros
Variable types: 6 continuous, 6 integer (6 binary)
Coefficient statistics:
  Matrix range     [7e-03, 1e+00]
  Objective range  [1e+00, 2e+04]
  Bounds range     [1e+00, 8e+01]
  RHS range        [5e+01, 1e+02]
Presolve removed 22 rows and 12 columns
Presolve time: 0.00s
Presolve: All rows and columns removed

Explored 0 nodes (0 simplex iterations) in 0.01 seconds
Thread count was 1 (of 8 available processors)

Solution count 1: 24750
Pool objective bound 24750

Optimal solution found (tolerance 0.00e+00)
Best objective 2.475000000000e+04, best bound 2.475000000000e+04, gap 0.0000%
[sum of all cost, 24750]
Flow New York to Paderborn_B        : 100
Flow São Paulo to Paderborn_C       : 0
Flow Paderborn to Beijing_D         : 50
Flow Beijing to New York_E          : 0
Flow São Paulo to Beijing_F         : 0
Flow San Francisco to São Paulo_G   : 50
Design New York to Paderborn_H      : 1
Design Beijing to New York_I        : 0
Design São Paulo to Beijing_J       : 0
Design San Francisco to São Paulo_K : 1
Design São Paulo to Paderborn_L     : 0
Design Paderborn to Beijing_M       : 1

Next Step

  • Here you can find even more Models