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.217256 seconds.
    local lower bound updated to 0.395138
    local upper bound updated to 0.577384

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.610053
    local lower bound updated to 0.605517

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.111811 seconds.
    local lower bound updated to 0.404787
    local upper bound updated to 0.575159

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.135215 seconds.
    local lower bound updated to 0.57353
    local upper bound updated to 0.574733

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.575803
    local lower bound updated to 0.574733

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.205782 seconds.
    local lower bound updated to 0.404787
    local upper bound updated to 0.574733

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0997733 seconds.
    local lower bound updated to 0.574733
    local upper bound updated to 0.574733
The time obtain the optimal randomized assortment is 1.15353 (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_61212.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: 128 physical cores, 128 logical processors, using up to 4 threads
Optimize a model with 352 rows, 324 columns and 1069 nonzeros
Model fingerprint: 0xcf722b1a
Variable types: 283 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [9e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 122 rows and 201 columns
Presolve time: 0.01s
Presolved: 230 rows, 123 columns, 834 nonzeros
Variable types: 90 continuous, 33 integer (33 binary)
Found heuristic solution: objective 0.6059666
Found heuristic solution: objective 0.6008977

Root relaxation: objective 5.100771e-01, 41 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.51008    0    8    0.60090    0.51008  15.1%     -    0s
H    0     0                       0.5795272    0.51008  12.0%     -    0s
     0     0    0.52077    0   11    0.57953    0.52077  10.1%     -    0s
H    0     0                       0.5776064    0.52077  9.84%     -    0s
H    0     0                       0.5768029    0.52077  9.72%     -    0s
     0     0    0.54434    0   14    0.57680    0.54434  5.63%     -    0s
H    0     0                       0.5747358    0.54440  5.28%     -    0s
     0     0    0.56297    0   15    0.57474    0.56297  2.05%     -    0s
H    0     0                       0.5747327    0.56297  2.05%     -    0s
     0     0    0.56954    0   13    0.57473    0.56954  0.90%     -    0s
     0     0    0.57470    0   13    0.57473    0.57470  0.01%     -    0s

Cutting planes:
  Cover: 1
  Implied bound: 19
  MIR: 5
  Flow cover: 19
  RLT: 1
  Relax-and-lift: 8

Explored 1 nodes (265 simplex iterations) in 0.11 seconds (0.01 work units)
Thread count was 4 (of 128 available processors)

Solution count 7: 0.574733 0.574736 0.576803 ... 0.605967

Optimal solution found (tolerance 1.00e-04)
Best objective 5.747326629732e-01, best bound 5.746987111402e-01, gap 0.0059%
The objective bound is 0.574699 while the objective upper bound is 0.574733

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

        Job resource usage summary 

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

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