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.0753766 seconds.
    local lower bound updated to 0.320664
    local upper bound updated to 0.628323

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.631123
    local lower bound updated to 0.627973

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.631042
    local lower bound updated to 0.630797

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.630797
    local lower bound updated to 0.630797
The Dual step takes 0.0439548 (S)
upper bound updated to 0.630797
*** OUTER ITERATION 1 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.197708 seconds.
    local lower bound updated to 0.47028
    local upper bound updated to 0.628779

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.630136
    local lower bound updated to 0.628779

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.19274 seconds.
    local lower bound updated to 0.47028
    local upper bound updated to 0.628779

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.149404 seconds.
    local lower bound updated to 0.628779
    local upper bound updated to 0.628779
The time obtain the optimal randomized assortment is 0.943501 (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_200.000000_201912.log"
The computation time limit for a lower bound is 85998
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 444 rows, 418 columns and 1355 nonzeros
Model fingerprint: 0xed83bfc3
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [3e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 154 rows and 270 columns
Presolve time: 0.01s
Presolved: 290 rows, 148 columns, 1075 nonzeros
Variable types: 112 continuous, 36 integer (36 binary)
Found heuristic solution: objective 0.6939374
Found heuristic solution: objective 0.6441791

Root relaxation: objective 4.090823e-01, 43 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.40908    0   11    0.64418    0.40908  36.5%     -    0s
     0     0    0.47371    0   16    0.64418    0.47371  26.5%     -    0s
     0     0    0.57212    0   16    0.64418    0.57212  11.2%     -    0s
     0     0    0.57612    0   16    0.64418    0.57612  10.6%     -    0s
     0     0    0.58522    0   15    0.64418    0.58522  9.15%     -    0s
     0     0    0.58594    0   16    0.64418    0.58594  9.04%     -    0s
H    0     0                       0.6383857    0.58594  8.22%     -    0s
     0     0    0.59933    0   14    0.63839    0.59933  6.12%     -    0s
H    0     0                       0.6313487    0.59933  5.07%     -    0s
     0     0    0.59946    0   14    0.63135    0.59946  5.05%     -    0s
     0     0    0.60717    0   14    0.63135    0.60717  3.83%     -    0s
H    0     0                       0.6287785    0.60717  3.44%     -    0s
     0     2    0.60717    0   14    0.62878    0.60717  3.44%     -    0s

Cutting planes:
  Implied bound: 32
  MIR: 6
  Flow cover: 27
  RLT: 2
  Relax-and-lift: 12

Explored 28 nodes (578 simplex iterations) in 0.14 seconds (0.04 work units)
Thread count was 4 (of 48 available processors)

Solution count 5: 0.628779 0.631349 0.638386 ... 0.693937

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

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

        Job resource usage summary 

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

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