Set parameter TokenServer to value "gurobi.cc.ic.ac.uk"

********************************
*** COLUMN GENERATION SCHEME ***
********************************

*** OUTER ITERATION 0 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0912159 seconds.
    local lower bound updated to 0.29423
    local upper bound updated to 0.586315

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0897329 seconds.
    local lower bound updated to 0.571563
    local upper bound updated to 0.571563
The Primal step takes 0.182586 (S)
lower bound updated to 0.571563

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.581272
    local lower bound updated to 0.571563

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.581272
    local lower bound updated to 0.578169

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.579021
    local lower bound updated to 0.578434

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.578434
    local lower bound updated to 0.578434
The Dual step takes 0.0531232 (S)
upper bound updated to 0.578434
*** OUTER ITERATION 1 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.310505 seconds.
    local lower bound updated to 0.397516
    local upper bound updated to 0.575005

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.301709 seconds.
    local lower bound updated to 0.558418
    local upper bound updated to 0.571628

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.281902 seconds.
    local lower bound updated to 0.571328
    local upper bound updated to 0.571563

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.199146 seconds.
    local lower bound updated to 0.571563
    local upper bound updated to 0.571563
The Primal step takes 1.10249 (S)
lower bound updated to 0.571563

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.576725
    local lower bound updated to 0.571563

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.571563
    local lower bound updated to 0.571563
The Dual step takes 0.0548147 (S)
upper bound updated to 0.571563
This is to get the final optimal randomized assortment

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.314908 seconds.
    local lower bound updated to 0.397516
    local upper bound updated to 0.571563

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.19021 seconds.
    local lower bound updated to 0.571563
    local upper bound updated to 0.571563
The time obtain the optimal randomized assortment is 1.90257 (S)
Now, the randomization optimization has been finished. We are checking the lower bound ....
Set parameter OutputFlag to value 1
Set parameter LogFile to value "/rds/general/user/zw1819/home/RAO/RAO_MC/FinalRun/RecFMResult/logFile_11_4_60.000000_60912.log"
The computation time limit for a lower bound is 85997
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 24 physical cores, 48 logical processors, using up to 4 threads
Optimize a model with 600 rows, 512 columns and 1841 nonzeros
Model fingerprint: 0x9deaa8e7
Variable types: 471 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-05, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 210 rows and 322 columns
Presolve time: 0.01s
Presolved: 390 rows, 190 columns, 1460 nonzeros
Variable types: 153 continuous, 37 integer (37 binary)
Found heuristic solution: objective 0.6035407
Found heuristic solution: objective 0.6029745

Root relaxation: objective 4.479017e-01, 51 iterations, 0.00 seconds (0.00 work units)

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0    0.44790    0    8    0.60297    0.44790  25.7%     -    0s
H    0     0                       0.5961681    0.44790  24.9%     -    0s
     0     0    0.47246    0   13    0.59617    0.47246  20.8%     -    0s
H    0     0                       0.5718791    0.47246  17.4%     -    0s
     0     0    0.49057    0   14    0.57188    0.49057  14.2%     -    0s
     0     0    0.49928    0   16    0.57188    0.49928  12.7%     -    0s
H    0     0                       0.5715632    0.51394  10.1%     -    0s
     0     0    0.51394    0   14    0.57156    0.51394  10.1%     -    0s
     0     0    0.51404    0   15    0.57156    0.51404  10.1%     -    0s
     0     0    0.52409    0   14    0.57156    0.52409  8.31%     -    0s
     0     0    0.52569    0   15    0.57156    0.52569  8.03%     -    0s
     0     0    0.52643    0   10    0.57156    0.52643  7.90%     -    0s
     0     2    0.52643    0   10    0.57156    0.52643  7.90%     -    0s

Cutting planes:
  Implied bound: 30
  MIR: 10
  Flow cover: 23
  RLT: 2
  Relax-and-lift: 21

Explored 61 nodes (1289 simplex iterations) in 0.19 seconds (0.07 work units)
Thread count was 4 (of 48 available processors)

Solution count 5: 0.571563 0.571879 0.596168 ... 0.603541

Optimal solution found (tolerance 1.00e-04)
Best objective 5.715632458355e-01, best bound 5.715632458355e-01, gap 0.0000%
The objective bound is 0.571563 while the objective upper bound is 0.571563

============================================

        Job resource usage summary 

                 Memory (GB)    NCPUs
 Requested  :        12             4
 Used       :         0 (peak)   3.49 (ave)

============================================
