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.655329 seconds.
    local lower bound updated to 0.254046
    local upper bound updated to 0.501885

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.527727
    local lower bound updated to 0.522946

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.527727
    local lower bound updated to 0.527386

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 3.49513 seconds.
    local lower bound updated to 0.382295
    local upper bound updated to 0.509694

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 4.83722 seconds.
    local lower bound updated to 0.494804
    local upper bound updated to 0.508414

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 2.26718 seconds.
    local lower bound updated to 0.494804
    local upper bound updated to 0.501747

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 1.90588 seconds.
    local lower bound updated to 0.497475
    local upper bound updated to 0.499238

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 1.76448 seconds.
    local lower bound updated to 0.497942
    local upper bound updated to 0.499209

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 3.41272 seconds.
    local lower bound updated to 0.498845
    local upper bound updated to 0.499197

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.514679
    local lower bound updated to 0.50715

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.514679
    local lower bound updated to 0.50715

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.514679
    local lower bound updated to 0.507231

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 5.98054 seconds.
    local lower bound updated to 0.425226
    local upper bound updated to 0.507204

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 2.66359 seconds.
    local lower bound updated to 0.498069
    local upper bound updated to 0.506737

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 2.80725 seconds.
    local lower bound updated to 0.505577
    local upper bound updated to 0.50656

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 2.60806 seconds.
    local lower bound updated to 0.506176
    local upper bound updated to 0.506479

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 3.06215 seconds.
    local lower bound updated to 0.506217
    local upper bound updated to 0.506414

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.516096
    local lower bound updated to 0.506414

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 5.89449 seconds.
    local lower bound updated to 0.425226
    local upper bound updated to 0.506414

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 3.25867 seconds.
    local lower bound updated to 0.506414
    local upper bound updated to 0.506414
The time obtain the optimal randomized assortment is 54.9718 (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_100.000000_106816.log"
The computation time limit for a lower bound is 85941
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 24 physical cores, 48 logical processors, using up to 4 threads
Optimize a model with 1200 rows, 968 columns and 3867 nonzeros
Model fingerprint: 0x212016f1
Variable types: 911 continuous, 57 integer (57 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 294 rows and 546 columns
Presolve time: 0.02s
Presolved: 906 rows, 422 columns, 3446 nonzeros
Variable types: 368 continuous, 54 integer (54 binary)
Found heuristic solution: objective 0.5834136
Found heuristic solution: objective 0.5657850

Root relaxation: objective 3.916794e-01, 124 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.39168    0   10    0.56578    0.39168  30.8%     -    0s
H    0     0                       0.5255382    0.39168  25.5%     -    0s
     0     0    0.39168    0   14    0.52554    0.39168  25.5%     -    0s
H    0     0                       0.5131946    0.39168  23.7%     -    0s
     0     0    0.43677    0   18    0.51319    0.43677  14.9%     -    0s
     0     0    0.43677    0   18    0.51319    0.43677  14.9%     -    0s
     0     0    0.44211    0   20    0.51319    0.44211  13.9%     -    0s
     0     0    0.44225    0   20    0.51319    0.44225  13.8%     -    0s
     0     0    0.45380    0   22    0.51319    0.45380  11.6%     -    0s
     0     0    0.45386    0   22    0.51319    0.45386  11.6%     -    0s
     0     0    0.45595    0   23    0.51319    0.45595  11.2%     -    0s
H    0     0                       0.5089648    0.45595  10.4%     -    0s
H    0     0                       0.5064144    0.45595  10.0%     -    0s
     0     2    0.45595    0   23    0.50641    0.45595  10.0%     -    0s
H  206   116                       0.5064144    0.46485  8.21%  19.8    1s
H  724   173                       0.5064144    0.47623  5.96%  17.3    1s

Cutting planes:
  Implied bound: 145
  MIR: 31
  Flow cover: 88
  RLT: 16
  Relax-and-lift: 72

Explored 2315 nodes (39855 simplex iterations) in 3.00 seconds (1.46 work units)
Thread count was 4 (of 48 available processors)

Solution count 8: 0.506414 0.506414 0.506414 ... 0.583414

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

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

        Job resource usage summary 

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

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