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.269888 seconds.
    local lower bound updated to 0.311073
    local upper bound updated to 0.535735

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.369358 seconds.
    local lower bound updated to 0.390653
    local upper bound updated to 0.549517

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.259839 seconds.
    local lower bound updated to 0.499839
    local upper bound updated to 0.545479

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.379 seconds.
    local lower bound updated to 0.540701
    local upper bound updated to 0.541147

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.33929 seconds.
    local lower bound updated to 0.540701
    local upper bound updated to 0.540704
The Primal step takes 1.35571 (S)
lower bound updated to 0.540701

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.578258
    local lower bound updated to 0.540704

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.464273 seconds.
    local lower bound updated to 0.422826
    local upper bound updated to 0.540704

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.545757 seconds.
    local lower bound updated to 0.540704
    local upper bound updated to 0.540704
The time obtain the optimal randomized assortment is 2.82851 (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_201614.log"
The computation time limit for a lower bound is 85996
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 582 rows, 498 columns and 1845 nonzeros
Model fingerprint: 0x4cd2c1c8
Variable types: 449 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [2e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 165 rows and 288 columns
Presolve time: 0.01s
Presolved: 417 rows, 210 columns, 1571 nonzeros
Variable types: 168 continuous, 42 integer (42 binary)
Found heuristic solution: objective 0.6785027
Found heuristic solution: objective 0.6591704

Root relaxation: objective 4.355698e-01, 69 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.43557    0   12    0.65917    0.43557  33.9%     -    0s
H    0     0                       0.5656079    0.43557  23.0%     -    0s
     0     0    0.43910    0   12    0.56561    0.43910  22.4%     -    0s
     0     0    0.47215    0   20    0.56561    0.47215  16.5%     -    0s
H    0     0                       0.5522912    0.47215  14.5%     -    0s
     0     0    0.47220    0   20    0.55229    0.47220  14.5%     -    0s
H    0     0                       0.5473120    0.47220  13.7%     -    0s
     0     0    0.47693    0   18    0.54731    0.47693  12.9%     -    0s
H    0     0                       0.5458559    0.47774  12.5%     -    0s
     0     0    0.47774    0   18    0.54586    0.47774  12.5%     -    0s
     0     0    0.48711    0   17    0.54586    0.48711  10.8%     -    0s
H    0     0                       0.5455496    0.49001  10.2%     -    0s
     0     0    0.49001    0   17    0.54555    0.49001  10.2%     -    0s
     0     0    0.49031    0   17    0.54555    0.49031  10.1%     -    0s
H    0     0                       0.5432225    0.49031  9.74%     -    0s
H    0     0                       0.5407043    0.49031  9.32%     -    0s
     0     2    0.49031    0   17    0.54070    0.49031  9.32%     -    0s

Cutting planes:
  Implied bound: 42
  MIR: 7
  Flow cover: 35
  RLT: 1
  Relax-and-lift: 20

Explored 257 nodes (2828 simplex iterations) in 0.50 seconds (0.15 work units)
Thread count was 4 (of 40 available processors)

Solution count 9: 0.540704 0.543223 0.54555 ... 0.678503

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

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

        Job resource usage summary 

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

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