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.221778 seconds.
    local lower bound updated to 0.360892
    local upper bound updated to 0.671757

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.70866
    local lower bound updated to 0.674404

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.63059 seconds.
    local lower bound updated to 0.494321
    local upper bound updated to 0.625654

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.194518 seconds.
    local lower bound updated to 0.62093
    local upper bound updated to 0.623886

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.676507
    local lower bound updated to 0.660531

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.36584 seconds.
    local lower bound updated to 0.526293
    local upper bound updated to 0.64066

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.282921 seconds.
    local lower bound updated to 0.563631
    local upper bound updated to 0.635509

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 1.65058 seconds.
    local lower bound updated to 0.629166
    local upper bound updated to 0.635046

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.968501 seconds.
    local lower bound updated to 0.630441
    local upper bound updated to 0.634522

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 1.20777 seconds.
    local lower bound updated to 0.630441
    local upper bound updated to 0.634026

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 2.20956 seconds.
    local lower bound updated to 0.630782
    local upper bound updated to 0.631728

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 1.00077 seconds.
    local lower bound updated to 0.630782
    local upper bound updated to 0.631522

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 1.61178 seconds.
    local lower bound updated to 0.630787
    local upper bound updated to 0.631457

    ++ RESTRICTED PRIMAL ITERATION 9 ++
One worst-case parameter optimization takes 1.63235 seconds.
    local lower bound updated to 0.631457
    local upper bound updated to 0.631457
The Primal step takes 11.9498 (S)
lower bound updated to 0.631457

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.66873
    local lower bound updated to 0.640412

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.647894
    local lower bound updated to 0.643202

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.643636
    local lower bound updated to 0.643276

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.03185 seconds.
    local lower bound updated to 0.569164
    local upper bound updated to 0.643276

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.398874 seconds.
    local lower bound updated to 0.616506
    local upper bound updated to 0.63841

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.493601 seconds.
    local lower bound updated to 0.634157
    local upper bound updated to 0.63834

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.743338 seconds.
    local lower bound updated to 0.634157
    local upper bound updated to 0.637584

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.62879 seconds.
    local lower bound updated to 0.635192
    local upper bound updated to 0.637547

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 0.776371 seconds.
    local lower bound updated to 0.636947
    local upper bound updated to 0.637267

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 0.852737 seconds.
    local lower bound updated to 0.636947
    local upper bound updated to 0.637248

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 0.657439 seconds.
    local lower bound updated to 0.636947
    local upper bound updated to 0.637103

    ++ RESTRICTED PRIMAL ITERATION 9 ++
One worst-case parameter optimization takes 0.816093 seconds.
    local lower bound updated to 0.637103
    local upper bound updated to 0.637103
The Primal step takes 7.42613 (S)
lower bound updated to 0.637103

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.65366
    local lower bound updated to 0.637103

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.640226
    local lower bound updated to 0.637362

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.637983
    local lower bound updated to 0.637366

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.637366
    local lower bound updated to 0.637366
The Dual step takes 0.756115 (S)
upper bound updated to 0.637366
*** OUTER ITERATION 4 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.8155 seconds.
    local lower bound updated to 0.580531
    local upper bound updated to 0.637366

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 1.38288 seconds.
    local lower bound updated to 0.637066
    local upper bound updated to 0.63736

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.950492 seconds.
    local lower bound updated to 0.637172
    local upper bound updated to 0.637358

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.944593 seconds.
    local lower bound updated to 0.637172
    local upper bound updated to 0.637346

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.973781 seconds.
    local lower bound updated to 0.637215
    local upper bound updated to 0.637326

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 1.24554 seconds.
    local lower bound updated to 0.637223
    local upper bound updated to 0.637287

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 0.816288 seconds.
    local lower bound updated to 0.637287
    local upper bound updated to 0.637287
The Primal step takes 9.15544 (S)
lower bound updated to 0.637287

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.651044
    local lower bound updated to 0.637287

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.80088 seconds.
    local lower bound updated to 0.580531
    local upper bound updated to 0.637287

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.810226 seconds.
    local lower bound updated to 0.637287
    local upper bound updated to 0.637287
The time obtain the optimal randomized assortment is 35.5075 (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_60.000000_68714.log"
The computation time limit for a lower bound is 85963
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 1338 rows, 1170 columns and 4210 nonzeros
Model fingerprint: 0x56b98aab
Variable types: 1121 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [2e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 407 rows and 751 columns
Presolve time: 0.01s
Presolved: 931 rows, 419 columns, 3524 nonzeros
Variable types: 372 continuous, 47 integer (47 binary)
Found heuristic solution: objective 0.7705202
Found heuristic solution: objective 0.6913086

Root relaxation: objective 5.140808e-01, 130 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.51408    0   15    0.69131    0.51408  25.6%     -    0s
H    0     0                       0.6798817    0.51408  24.4%     -    0s
H    0     0                       0.6753968    0.53685  20.5%     -    0s
     0     0    0.53695    0   20    0.67540    0.53695  20.5%     -    0s
H    0     0                       0.6736381    0.53695  20.3%     -    0s
     0     0    0.53695    0   20    0.67364    0.53695  20.3%     -    0s
H    0     0                       0.6692432    0.57236  14.5%     -    0s
     0     0    0.57236    0   21    0.66924    0.57236  14.5%     -    0s
H    0     0                       0.6390233    0.57236  10.4%     -    0s
     0     0    0.57288    0   21    0.63902    0.57288  10.4%     -    0s
     0     0    0.58167    0   23    0.63902    0.58167  8.98%     -    0s
H    0     0                       0.6386120    0.58240  8.80%     -    0s
     0     0    0.58240    0   23    0.63861    0.58240  8.80%     -    0s
H    0     0                       0.6375526    0.58240  8.65%     -    0s
H    0     0                       0.6374915    0.58240  8.64%     -    0s
     0     0    0.59169    0   23    0.63749    0.59169  7.18%     -    0s
     0     0    0.59262    0   22    0.63749    0.59262  7.04%     -    0s
     0     0    0.59567    0   23    0.63749    0.59567  6.56%     -    0s
H    0     0                       0.6372875    0.59567  6.53%     -    0s
     0     2    0.59567    0   23    0.63729    0.59567  6.53%     -    0s
H  253    49                       0.6372875    0.62418  2.06%  15.3    0s

Cutting planes:
  Implied bound: 106
  MIR: 22
  Flow cover: 120
  RLT: 2
  Relax-and-lift: 49

Explored 505 nodes (7546 simplex iterations) in 0.83 seconds (0.49 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.637287 0.637491 0.637553 ... 0.691309

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

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

        Job resource usage summary 

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

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