Constraint 2 is relaxed
Constraint 3 is not relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is not relaxed
The time to read the input and initialise the problem = 235 ms

Iteration 1
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 2632.000000 + 466.000000 = 3098.000000
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 50230.000000
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 2632.000000 + 7535.800000 = 10167.800000
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 50230.000000
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 478.905200 + 13545.130000 = 14024.035200
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 15648.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 946.607072 + 13311.279069 = 14257.886141
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 15648.000000
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 1237.897328 + 13111.102673 = 14349.000001
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 14349.000000
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.
The duality gap is acceptably small.
 The current upper (and lower) bound are taken as optimal.
The best upper bound = 14349.000000, the best lower bound = 14349.000001
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 8422 ms
The total time to calculate the lower bounds with CPLEX = 46 ms
The total time to calculate the upper bounds with CPLEX = 31 ms
The total time to create the lower bound problems = 64 ms
The total time to read the lower bound solutions = 16 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 15 ms
The total time to read the upper bound solutions = 0 ms 

The best upper bound found = 14349.000000, the best lower bound found = 14349.000001
Therefore the duality gap is 0.000000%
