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.151083 seconds.
    local lower bound updated to 0.326503
    local upper bound updated to 0.560623

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.605739
    local lower bound updated to 0.591462

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.226614 seconds.
    local lower bound updated to 0.405407
    local upper bound updated to 0.562682

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.200694 seconds.
    local lower bound updated to 0.541767
    local upper bound updated to 0.55363

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.572198
    local lower bound updated to 0.565448

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.571199
    local lower bound updated to 0.566796

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.566796
    local lower bound updated to 0.566796
The Dual step takes 0.217978 (S)
upper bound updated to 0.566796
*** OUTER ITERATION 2 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.312792 seconds.
    local lower bound updated to 0.425426
    local upper bound updated to 0.55813

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.420961 seconds.
    local lower bound updated to 0.543138
    local upper bound updated to 0.556123

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.355429 seconds.
    local lower bound updated to 0.551837
    local upper bound updated to 0.554404

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.38406 seconds.
    local lower bound updated to 0.551837
    local upper bound updated to 0.554301

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.361727 seconds.
    local lower bound updated to 0.554301
    local upper bound updated to 0.554301
The Primal step takes 1.84827 (S)
lower bound updated to 0.554301

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.571937
    local lower bound updated to 0.554301

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.561616
    local lower bound updated to 0.558195

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.446786 seconds.
    local lower bound updated to 0.453674
    local upper bound updated to 0.558195

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.773219 seconds.
    local lower bound updated to 0.545424
    local upper bound updated to 0.557979

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.583849
    local lower bound updated to 0.557979

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.453039 seconds.
    local lower bound updated to 0.453674
    local upper bound updated to 0.557979

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 2.03867 seconds.
    local lower bound updated to 0.557979
    local upper bound updated to 0.557979
The time obtain the optimal randomized assortment is 9.04959 (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_13_4_200.000000_207514.log"
The computation time limit for a lower bound is 85989
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 834 rows, 722 columns and 2616 nonzeros
Model fingerprint: 0x2fcfc938
Variable types: 673 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [1e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 239 rows and 446 columns
Presolve time: 0.01s
Presolved: 595 rows, 276 columns, 2221 nonzeros
Variable types: 234 continuous, 42 integer (42 binary)
Found heuristic solution: objective 0.6678247
Found heuristic solution: objective 0.6399448

Root relaxation: objective 3.769289e-01, 86 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.37693    0   14    0.63994    0.37693  41.1%     -    0s
H    0     0                       0.5697387    0.40843  28.3%     -    0s
     0     0    0.40843    0   18    0.56974    0.40843  28.3%     -    0s
     0     0    0.45894    0   21    0.56974    0.45894  19.4%     -    0s
H    0     0                       0.5694299    0.46080  19.1%     -    0s
     0     0    0.46080    0   21    0.56943    0.46080  19.1%     -    0s
     0     0    0.47287    0   18    0.56943    0.47287  17.0%     -    0s
H    0     0                       0.5654973    0.47287  16.4%     -    0s
     0     0    0.47289    0   18    0.56550    0.47289  16.4%     -    0s
     0     0    0.47808    0   19    0.56550    0.47808  15.5%     -    0s
H    0     0                       0.5613080    0.47808  14.8%     -    0s
     0     0    0.47961    0   19    0.56131    0.47961  14.6%     -    0s
     0     0    0.48480    0   21    0.56131    0.48480  13.6%     -    0s
H    0     0                       0.5579790    0.48480  13.1%     -    0s
     0     2    0.48480    0   21    0.55798    0.48480  13.1%     -    0s
H  770   100                       0.5579790    0.52970  5.07%  11.0    1s
H 1043    67                       0.5579790    0.53584  3.97%  11.0    1s

Cutting planes:
  Implied bound: 91
  MIR: 39
  Flow cover: 99
  RLT: 5
  Relax-and-lift: 42

Explored 1401 nodes (15930 simplex iterations) in 2.07 seconds (0.92 work units)
Thread count was 4 (of 48 available processors)

Solution count 8: 0.557979 0.557979 0.561308 ... 0.667825

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

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

        Job resource usage summary 

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

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