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.57588 seconds.
    local lower bound updated to 0.323877
    local upper bound updated to 0.594818

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.620942
    local lower bound updated to 0.620452

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.620942
    local lower bound updated to 0.620719

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 14.2246 seconds.
    local lower bound updated to 0.432424
    local upper bound updated to 0.579166

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 4.29397 seconds.
    local lower bound updated to 0.568666
    local upper bound updated to 0.569872

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.905194 seconds.
    local lower bound updated to 0.569275
    local upper bound updated to 0.569783

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.624122
    local lower bound updated to 0.59375

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.598999
    local lower bound updated to 0.596273

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.598999
    local lower bound updated to 0.597209

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 24.197 seconds.
    local lower bound updated to 0.491452
    local upper bound updated to 0.589871

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 5.28876 seconds.
    local lower bound updated to 0.570947
    local upper bound updated to 0.58235

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 19.0721 seconds.
    local lower bound updated to 0.57885
    local upper bound updated to 0.581116

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 21.1701 seconds.
    local lower bound updated to 0.57885
    local upper bound updated to 0.581048

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 29.7874 seconds.
    local lower bound updated to 0.580278
    local upper bound updated to 0.581009

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 29.7874 seconds.
    local lower bound updated to 0.581009
    local upper bound updated to 0.581009
The Primal step takes 129.323 (S)
lower bound updated to 0.581009

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.600909
    local lower bound updated to 0.581009

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.582856
    local lower bound updated to 0.581235

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.582856
    local lower bound updated to 0.581408

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.581867
    local lower bound updated to 0.581424

    ++ RESTRICTED DUAL ITERATION 5 ++
    local upper bound updated to 0.581424
    local lower bound updated to 0.581424
The Dual step takes 1.05741 (S)
upper bound updated to 0.581424
*** OUTER ITERATION 3 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 41.6012 seconds.
    local lower bound updated to 0.512856
    local upper bound updated to 0.581424

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 29.4313 seconds.
    local lower bound updated to 0.580761
    local upper bound updated to 0.581367

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 38.7651 seconds.
    local lower bound updated to 0.581132
    local upper bound updated to 0.581349

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 32.9469 seconds.
    local lower bound updated to 0.581206
    local upper bound updated to 0.581322

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.601866
    local lower bound updated to 0.581322

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 42.2122 seconds.
    local lower bound updated to 0.512856
    local upper bound updated to 0.581322

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 34.9235 seconds.
    local lower bound updated to 0.581322
    local upper bound updated to 0.581322
The time obtain the optimal randomized assortment is 411.052 (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_100.000000_108818.log"
The computation time limit for a lower bound is 85582
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 6682 nonzeros
Model fingerprint: 0x5d94a8cd
Variable types: 1481 continuous, 65 integer (65 binary)
Coefficient statistics:
  Matrix range     [6e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [7e-01, 1e+00]
Presolve removed 472 rows and 842 columns
Presolve time: 0.02s
Presolved: 1550 rows, 704 columns, 6106 nonzeros
Variable types: 642 continuous, 62 integer (62 binary)
Found heuristic solution: objective 0.6932848
Found heuristic solution: objective 0.6791049
Found heuristic solution: objective 0.6700578

Root relaxation: objective 4.341931e-01, 165 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.43419    0   17    0.67006    0.43419  35.2%     -    0s
H    0     0                       0.6400131    0.43419  32.2%     -    0s
H    0     0                       0.6285950    0.43419  30.9%     -    0s
     0     0    0.44173    0   24    0.62859    0.44173  29.7%     -    0s
     0     0    0.49412    0   31    0.62859    0.49412  21.4%     -    0s
     0     0    0.49430    0   30    0.62859    0.49430  21.4%     -    0s
H    0     0                       0.6036087    0.50033  17.1%     -    0s
     0     0    0.50033    0   31    0.60361    0.50033  17.1%     -    0s
     0     0    0.50116    0   32    0.60361    0.50116  17.0%     -    0s
H    0     0                       0.5896637    0.50116  15.0%     -    0s
H    0     0                       0.5872615    0.50116  14.7%     -    0s
     0     0    0.51144    0   28    0.58726    0.51144  12.9%     -    0s
H    0     0                       0.5827987    0.51144  12.2%     -    0s
     0     0    0.51167    0   31    0.58280    0.51167  12.2%     -    0s
     0     0    0.51375    0   30    0.58280    0.51375  11.8%     -    0s
H    0     0                       0.5813218    0.51375  11.6%     -    1s
     0     2    0.51375    0   30    0.58132    0.51375  11.6%     -    1s
  2559   849    0.58070   18   10    0.58132    0.54627  6.03%  19.2    5s
  3197   989    0.55889   14   32    0.58132    0.54821  5.70%  18.9   10s
  3599  1067     cutoff   32         0.58132    0.54821  5.70%  20.4   15s
  5100   878    0.55914   26   20    0.58132    0.55280  4.91%  20.8   20s
  6979   795    0.57618   24   14    0.58132    0.55812  3.99%  21.0   25s
  8700   865    0.57152   26   16    0.58132    0.56121  3.46%  20.9   30s
 10186   854    0.56872   25   18    0.58132    0.56363  3.04%  20.9   35s
H11087   836                       0.5813218    0.56485  2.83%  20.8   36s
 12846   716    0.57682   28   17    0.58132    0.56797  2.30%  20.7   40s
 16090   500     cutoff   34         0.58132    0.57326  1.39%  19.9   45s

Cutting planes:
  Implied bound: 160
  MIR: 111
  Flow cover: 321
  RLT: 30
  Relax-and-lift: 59

Explored 18344 nodes (350389 simplex iterations) in 46.92 seconds (39.74 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.581322 0.582799 0.587262 ... 0.693285

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

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

        Job resource usage summary 

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

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