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

Iteration 1
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 94 ms
The lower bound solution is:
z = 36672.000000
The time to read the lower bound solution = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 36672.000000
The optimal solution has been found!
The optimal solution = 36672.000000
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 2468 ms
The total time to calculate the lower bounds with CPLEX = 94 ms
The total time to calculate the upper bounds with CPLEX = 15 ms
The total time to create the lower bound problems = 0 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 = 0 ms
The total time to read the upper bound solutions = 0 ms 

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