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 2.72563 seconds.
    local lower bound updated to 0.325156
    local upper bound updated to 0.63032

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.666472
    local lower bound updated to 0.654647

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 94.2586 seconds.
    local lower bound updated to 0.453526
    local upper bound updated to 0.620474

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 12.5432 seconds.
    local lower bound updated to 0.56508
    local upper bound updated to 0.609596

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 10.9106 seconds.
    local lower bound updated to 0.578604
    local upper bound updated to 0.589558

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.64232
    local lower bound updated to 0.627866

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.031 seconds.
    local lower bound updated to 0.495126
    local upper bound updated to 0.627866

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.770663 seconds.
    local lower bound updated to 0.550292
    local upper bound updated to 0.613765

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 15.4676 seconds.
    local lower bound updated to 0.597963
    local upper bound updated to 0.609963

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 14.2823 seconds.
    local lower bound updated to 0.599577
    local upper bound updated to 0.600283

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.637974
    local lower bound updated to 0.60738

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.623892
    local lower bound updated to 0.618413

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.623892
    local lower bound updated to 0.619071

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.02 seconds.
    local lower bound updated to 0.535352
    local upper bound updated to 0.608648

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 43.1787 seconds.
    local lower bound updated to 0.60402
    local upper bound updated to 0.608231

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 37.9338 seconds.
    local lower bound updated to 0.606299
    local upper bound updated to 0.608186

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 50.8631 seconds.
    local lower bound updated to 0.606432
    local upper bound updated to 0.607956

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 50.0956 seconds.
    local lower bound updated to 0.606698
    local upper bound updated to 0.607568

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 48.8165 seconds.
    local lower bound updated to 0.606698
    local upper bound updated to 0.607473

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 58.3115 seconds.
    local lower bound updated to 0.606698
    local upper bound updated to 0.607062

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 45.7054 seconds.
    local lower bound updated to 0.606698
    local upper bound updated to 0.606972

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.625491
    local lower bound updated to 0.606972

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.609551
    local lower bound updated to 0.608051

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.023 seconds.
    local lower bound updated to 0.542289
    local upper bound updated to 0.608051

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.625485
    local lower bound updated to 0.608051

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.608628
    local lower bound updated to 0.608051

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.023 seconds.
    local lower bound updated to 0.545759
    local upper bound updated to 0.608051

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 64.7948 seconds.
    local lower bound updated to 0.608051
    local upper bound updated to 0.608051
The time obtain the optimal randomized assortment is 1472.16 (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_17_4_200.000000_204318.log"
The computation time limit for a lower bound is 84523
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 2022 rows, 1546 columns and 6672 nonzeros
Model fingerprint: 0xe8577171
Variable types: 1481 continuous, 65 integer (65 binary)
Coefficient statistics:
  Matrix range     [5e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 483 rows and 841 columns
Presolve time: 0.02s
Presolved: 1539 rows, 705 columns, 6090 nonzeros
Variable types: 643 continuous, 62 integer (62 binary)
Found heuristic solution: objective 0.7152882
Found heuristic solution: objective 0.6961811

Root relaxation: objective 4.483285e-01, 162 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.44833    0   18    0.69618    0.44833  35.6%     -    0s
H    0     0                       0.6527094    0.44833  31.3%     -    0s
H    0     0                       0.6470180    0.45563  29.6%     -    0s
     0     0    0.45563    0   22    0.64702    0.45563  29.6%     -    0s
H    0     0                       0.6412604    0.45563  28.9%     -    0s
     0     0    0.49555    0   28    0.64126    0.49555  22.7%     -    0s
H    0     0                       0.6288437    0.49555  21.2%     -    0s
     0     0    0.49555    0   28    0.62884    0.49555  21.2%     -    0s
     0     0    0.51078    0   30    0.62884    0.51078  18.8%     -    0s
     0     0    0.51147    0   30    0.62884    0.51147  18.7%     -    0s
H    0     0                       0.6097381    0.51147  16.1%     -    0s
     0     0    0.51972    0   30    0.60974    0.51972  14.8%     -    0s
     0     0    0.52087    0   32    0.60974    0.52087  14.6%     -    0s
     0     0    0.52221    0   29    0.60974    0.52221  14.4%     -    0s
H    0     0                       0.6080513    0.52221  14.1%     -    0s
     0     2    0.52221    0   29    0.60805    0.52221  14.1%     -    1s
   587   302     cutoff   10         0.60805    0.54605  10.2%  23.2    5s
  2074   804    0.56656    7   31    0.60805    0.55856  8.14%  19.9   10s
H 2564   852                       0.6080513    0.55856  8.14%  23.0   11s
  3618   733    0.58466   22   22    0.60805    0.56616  6.89%  24.1   15s
  4982   743     cutoff   24         0.60805    0.57243  5.86%  24.0   20s
  5959   908    0.59903   19   16    0.60805    0.57560  5.34%  24.3   25s
  7911  1189     cutoff   24         0.60805    0.57964  4.67%  24.0   30s
  9458  1290    0.60065   24   14    0.60805    0.58185  4.31%  23.8   35s
 11529  1359 infeasible   28         0.60805    0.58409  3.94%  23.4   41s
 13067  1369 infeasible   25         0.60805    0.58574  3.67%  23.2   45s
 15491  1261    0.60539   26   15    0.60805    0.58780  3.33%  22.8   50s
 17248  1146    0.60709   24    6    0.60805    0.59009  2.95%  22.6   55s
 19615   888     cutoff   26         0.60805    0.59276  2.51%  22.1   60s

Cutting planes:
  Implied bound: 149
  MIR: 123
  Flow cover: 338
  RLT: 43
  Relax-and-lift: 50

Explored 23159 nodes (500113 simplex iterations) in 64.57 seconds (60.21 work units)
Thread count was 4 (of 40 available processors)

Solution count 9: 0.608051 0.608051 0.609738 ... 0.715288

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

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

        Job resource usage summary 

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

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