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.947474 seconds.
    local lower bound updated to 0.269773
    local upper bound updated to 0.496019

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.546641
    local lower bound updated to 0.519048

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.50716 seconds.
    local lower bound updated to 0.348008
    local upper bound updated to 0.490359

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.822227 seconds.
    local lower bound updated to 0.483252
    local upper bound updated to 0.483621

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.51567
    local lower bound updated to 0.483621

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.513531
    local lower bound updated to 0.50419

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.513531
    local lower bound updated to 0.504233

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.513531
    local lower bound updated to 0.505822

    ++ RESTRICTED DUAL ITERATION 5 ++
    local upper bound updated to 0.506767
    local lower bound updated to 0.505903

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.96151 seconds.
    local lower bound updated to 0.435039
    local upper bound updated to 0.495483

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 1.18002 seconds.
    local lower bound updated to 0.459907
    local upper bound updated to 0.494571

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 1.70809 seconds.
    local lower bound updated to 0.480156
    local upper bound updated to 0.492801

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 1.69731 seconds.
    local lower bound updated to 0.484676
    local upper bound updated to 0.492714

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 1.4433 seconds.
    local lower bound updated to 0.487072
    local upper bound updated to 0.491791

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 2.00396 seconds.
    local lower bound updated to 0.490576
    local upper bound updated to 0.491741

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 2.0183 seconds.
    local lower bound updated to 0.491661
    local upper bound updated to 0.491686

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 2.2784 seconds.
    local lower bound updated to 0.491686
    local upper bound updated to 0.491686
The Primal step takes 15.3168 (S)
lower bound updated to 0.491686

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.510416
    local lower bound updated to 0.491686

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.50007
    local lower bound updated to 0.494555

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.495319
    local lower bound updated to 0.494675

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.495319
    local lower bound updated to 0.494732

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 6.40276 seconds.
    local lower bound updated to 0.452343
    local upper bound updated to 0.494681

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 4.23746 seconds.
    local lower bound updated to 0.476683
    local upper bound updated to 0.494425

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 9.07314 seconds.
    local lower bound updated to 0.488932
    local upper bound updated to 0.494324

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 11.2091 seconds.
    local lower bound updated to 0.488932
    local upper bound updated to 0.494149

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 5.15252 seconds.
    local lower bound updated to 0.491645
    local upper bound updated to 0.49408

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 11.0836 seconds.
    local lower bound updated to 0.492921
    local upper bound updated to 0.49392

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 7.7865 seconds.
    local lower bound updated to 0.492921
    local upper bound updated to 0.493856

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 9.17785 seconds.
    local lower bound updated to 0.492921
    local upper bound updated to 0.493628

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.516657
    local lower bound updated to 0.493628

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 6.59066 seconds.
    local lower bound updated to 0.452343
    local upper bound updated to 0.493628

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 7.21975 seconds.
    local lower bound updated to 0.493628
    local upper bound updated to 0.493628
The time obtain the optimal randomized assortment is 107.82 (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_15_4_60.000000_69116.log"
The computation time limit for a lower bound is 85890
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 1680 rows, 1358 columns and 5386 nonzeros
Model fingerprint: 0x39e1243d
Variable types: 1301 continuous, 57 integer (57 binary)
Coefficient statistics:
  Matrix range     [1e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 429 rows and 801 columns
Presolve time: 0.02s
Presolved: 1251 rows, 557 columns, 4805 nonzeros
Variable types: 503 continuous, 54 integer (54 binary)
Found heuristic solution: objective 0.6622615
Found heuristic solution: objective 0.5738061

Root relaxation: objective 3.046322e-01, 180 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.30463    0   22    0.57381    0.30463  46.9%     -    0s
H    0     0                       0.5449499    0.31290  42.6%     -    0s
     0     0    0.31290    0   23    0.54495    0.31290  42.6%     -    0s
     0     0    0.31297    0   21    0.54495    0.31297  42.6%     -    0s
     0     0    0.37568    0   24    0.54495    0.37568  31.1%     -    0s
H    0     0                       0.5056238    0.37568  25.7%     -    0s
     0     0    0.37568    0   23    0.50562    0.37568  25.7%     -    0s
H    0     0                       0.5005793    0.37568  25.0%     -    0s
     0     0    0.38427    0   25    0.50058    0.38427  23.2%     -    0s
H    0     0                       0.4988217    0.38427  23.0%     -    0s
     0     0    0.38710    0   27    0.49882    0.38710  22.4%     -    0s
     0     0    0.39812    0   24    0.49882    0.39812  20.2%     -    0s
H    0     0                       0.4960215    0.39812  19.7%     -    0s
H    0     0                       0.4958659    0.39897  19.5%     -    0s
     0     0    0.39897    0   24    0.49587    0.39897  19.5%     -    0s
H    0     0                       0.4947607    0.39897  19.4%     -    0s
     0     0    0.39972    0   25    0.49476    0.39972  19.2%     -    0s
H    0     0                       0.4936277    0.39972  19.0%     -    1s
     0     2    0.39972    0   25    0.49363    0.39972  19.0%     -    1s
H  234   106                       0.4936277    0.43691  11.5%  18.8    2s
  1687   336    0.48992    8   13    0.49363    0.46388  6.03%  16.4    5s

Cutting planes:
  Implied bound: 179
  MIR: 54
  Flow cover: 170
  RLT: 32
  Relax-and-lift: 78

Explored 4607 nodes (69837 simplex iterations) in 8.63 seconds (6.14 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.493628 0.493628 0.494761 ... 0.573806

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

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

        Job resource usage summary 

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

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