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.124819 seconds.
    local lower bound updated to 0.339409
    local upper bound updated to 0.652896

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.735829
    local lower bound updated to 0.723964

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.22889 seconds.
    local lower bound updated to 0.432108
    local upper bound updated to 0.653859

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.218554 seconds.
    local lower bound updated to 0.647509
    local upper bound updated to 0.648392

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.681938
    local lower bound updated to 0.65834

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.316615 seconds.
    local lower bound updated to 0.486826
    local upper bound updated to 0.650001

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.203798 seconds.
    local lower bound updated to 0.64884
    local upper bound updated to 0.649461

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.212125 seconds.
    local lower bound updated to 0.64884
    local upper bound updated to 0.64903

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.675765
    local lower bound updated to 0.649187

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.356103 seconds.
    local lower bound updated to 0.518284
    local upper bound updated to 0.649187

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.670012
    local lower bound updated to 0.649187

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.376161 seconds.
    local lower bound updated to 0.518284
    local upper bound updated to 0.649187

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.392728 seconds.
    local lower bound updated to 0.649187
    local upper bound updated to 0.649187
The time obtain the optimal randomized assortment is 3.68366 (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_208114.log"
The computation time limit for a lower bound is 85995
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 20 physical cores, 40 logical processors, using up to 4 threads
Optimize a model with 708 rows, 610 columns and 2238 nonzeros
Model fingerprint: 0xf6207b3a
Variable types: 561 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        [6e-01, 1e+00]
Presolve removed 199 rows and 365 columns
Presolve time: 0.01s
Presolved: 509 rows, 245 columns, 1945 nonzeros
Variable types: 200 continuous, 45 integer (45 binary)
Found heuristic solution: objective 0.7334182
Found heuristic solution: objective 0.6568723

Root relaxation: objective 5.610709e-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.56107    0   15    0.65687    0.56107  14.6%     -    0s
     0     0    0.57163    0   18    0.65687    0.57163  13.0%     -    0s
     0     0    0.59713    0   19    0.65687    0.59713  9.10%     -    0s
     0     0    0.59957    0   20    0.65687    0.59957  8.72%     -    0s
H    0     0                       0.6504021    0.59957  7.82%     -    0s
     0     0    0.62164    0   19    0.65040    0.62164  4.42%     -    0s
     0     0    0.62227    0   18    0.65040    0.62227  4.32%     -    0s
H    0     0                       0.6492968    0.62227  4.16%     -    0s
     0     0    0.63092    0   20    0.64930    0.63092  2.83%     -    0s
     0     0    0.63311    0   19    0.64930    0.63311  2.49%     -    0s
     0     0    0.63406    0   20    0.64930    0.63406  2.35%     -    0s
H    0     0                       0.6491871    0.63406  2.33%     -    0s
     0     2    0.63406    0   20    0.64919    0.63406  2.33%     -    0s

Cutting planes:
  Gomory: 2
  Implied bound: 63
  MIR: 27
  Flow cover: 50
  RLT: 3
  Relax-and-lift: 27

Explored 127 nodes (1763 simplex iterations) in 0.41 seconds (0.15 work units)
Thread count was 4 (of 40 available processors)

Solution count 5: 0.649187 0.649297 0.650402 ... 0.733418

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

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

        Job resource usage summary 

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

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