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.130765 seconds.
    local lower bound updated to 0.365095
    local upper bound updated to 0.626647

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.645189
    local lower bound updated to 0.623844

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.623844
    local lower bound updated to 0.623844
The Dual step takes 0.0219767 (S)
upper bound updated to 0.623844
*** OUTER ITERATION 1 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0601192 seconds.
    local lower bound updated to 0.429935
    local upper bound updated to 0.612452

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0760359 seconds.
    local lower bound updated to 0.596493
    local upper bound updated to 0.609391

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.10953 seconds.
    local lower bound updated to 0.609391
    local upper bound updated to 0.609391
The Primal step takes 0.250367 (S)
lower bound updated to 0.609391

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.616294
    local lower bound updated to 0.609391

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.609621
    local lower bound updated to 0.609391

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0885632 seconds.
    local lower bound updated to 0.472799
    local upper bound updated to 0.609391

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.136658 seconds.
    local lower bound updated to 0.609391
    local upper bound updated to 0.609391
The time obtain the optimal randomized assortment is 0.819271 (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_201612.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: 128 physical cores, 256 logical processors, using up to 4 threads
Optimize a model with 444 rows, 418 columns and 1346 nonzeros
Model fingerprint: 0xd4ec68cd
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 142 rows and 265 columns
Presolve time: 0.00s
Presolved: 302 rows, 153 columns, 1073 nonzeros
Variable types: 119 continuous, 34 integer (34 binary)
Found heuristic solution: objective 0.6528586
Found heuristic solution: objective 0.6245624

Root relaxation: objective 4.686701e-01, 48 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.46867    0    8    0.62456    0.46867  25.0%     -    0s
     0     0    0.48059    0   10    0.62456    0.48059  23.1%     -    0s
     0     0    0.52799    0   11    0.62456    0.52799  15.5%     -    0s
H    0     0                       0.6170671    0.52799  14.4%     -    0s
     0     0    0.54969    0   11    0.61707    0.54969  10.9%     -    0s
H    0     0                       0.6096327    0.54969  9.83%     -    0s
H    0     0                       0.6093913    0.55868  8.32%     -    0s
     0     0    0.55868    0   11    0.60939    0.55868  8.32%     -    0s
     0     0    0.58054    0   11    0.60939    0.58054  4.74%     -    0s
     0     0    0.58411    0   11    0.60939    0.58411  4.15%     -    0s
     0     0    0.58479    0   12    0.60939    0.58479  4.04%     -    0s
     0     0    0.58758    0   11    0.60939    0.58758  3.58%     -    0s
     0     2    0.58758    0   11    0.60939    0.58758  3.58%     -    0s

Cutting planes:
  Implied bound: 19
  MIR: 5
  Flow cover: 20
  RLT: 5
  Relax-and-lift: 9

Explored 41 nodes (769 simplex iterations) in 0.14 seconds (0.04 work units)
Thread count was 4 (of 256 available processors)

Solution count 5: 0.609391 0.609633 0.617067 ... 0.652859

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

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

        Job resource usage summary 

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

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