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.805632 seconds.
    local lower bound updated to 0.297777
    local upper bound updated to 0.551798

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.589564
    local lower bound updated to 0.574739

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.576221
    local lower bound updated to 0.575942

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 13.4205 seconds.
    local lower bound updated to 0.42795
    local upper bound updated to 0.560249

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 2.93508 seconds.
    local lower bound updated to 0.550941
    local upper bound updated to 0.558749

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 5.71086 seconds.
    local lower bound updated to 0.550941
    local upper bound updated to 0.555022

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 4.79941 seconds.
    local lower bound updated to 0.553098
    local upper bound updated to 0.554025

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 5.41949 seconds.
    local lower bound updated to 0.553098
    local upper bound updated to 0.553615

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 4.89552 seconds.
    local lower bound updated to 0.553108
    local upper bound updated to 0.553594

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.582264
    local lower bound updated to 0.560336

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.57102
    local lower bound updated to 0.561136

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 5.1645 seconds.
    local lower bound updated to 0.464801
    local upper bound updated to 0.557852

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 4.48409 seconds.
    local lower bound updated to 0.551073
    local upper bound updated to 0.555076

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 7.29997 seconds.
    local lower bound updated to 0.554057
    local upper bound updated to 0.554914

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 7.45683 seconds.
    local lower bound updated to 0.554354
    local upper bound updated to 0.554813

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 6.71789 seconds.
    local lower bound updated to 0.55458
    local upper bound updated to 0.554728

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.57416
    local lower bound updated to 0.55565

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 9.17265 seconds.
    local lower bound updated to 0.478426
    local upper bound updated to 0.55565

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 6.17554 seconds.
    local lower bound updated to 0.555317
    local upper bound updated to 0.555461

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 6.48116 seconds.
    local lower bound updated to 0.555348
    local upper bound updated to 0.555449

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 7.70007 seconds.
    local lower bound updated to 0.555348
    local upper bound updated to 0.555448

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.570713
    local lower bound updated to 0.555448

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 8.60551 seconds.
    local lower bound updated to 0.478426
    local upper bound updated to 0.555448

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 10.1079 seconds.
    local lower bound updated to 0.555448
    local upper bound updated to 0.555448
The time obtain the optimal randomized assortment is 141.418 (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_200.000000_209716.log"
The computation time limit for a lower bound is 85853
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 3875 nonzeros
Model fingerprint: 0x8fab5823
Variable types: 911 continuous, 57 integer (57 binary)
Coefficient statistics:
  Matrix range     [1e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 299 rows and 545 columns
Presolve time: 0.01s
Presolved: 901 rows, 423 columns, 3417 nonzeros
Variable types: 370 continuous, 53 integer (53 binary)
Found heuristic solution: objective 0.6745501
Found heuristic solution: objective 0.6526840

Root relaxation: objective 4.343051e-01, 84 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.43431    0   16    0.65268    0.43431  33.5%     -    0s
H    0     0                       0.6175374    0.43431  29.7%     -    0s
H    0     0                       0.6168861    0.43431  29.6%     -    0s
     0     0    0.43453    0   18    0.61689    0.43453  29.6%     -    0s
H    0     0                       0.6130936    0.43453  29.1%     -    0s
H    0     0                       0.5884616    0.43453  26.2%     -    0s
     0     0    0.46170    0   24    0.58846    0.46170  21.5%     -    0s
H    0     0                       0.5875247    0.46170  21.4%     -    0s
H    0     0                       0.5861018    0.46228  21.1%     -    0s
     0     0    0.46465    0   25    0.58610    0.46465  20.7%     -    0s
     0     0    0.46924    0   24    0.58610    0.46924  19.9%     -    0s
     0     0    0.46942    0   26    0.58610    0.46942  19.9%     -    0s
     0     0    0.47543    0   22    0.58610    0.47543  18.9%     -    0s
H    0     0                       0.5816776    0.47543  18.3%     -    0s
H    0     0                       0.5678150    0.47580  16.2%     -    0s
H    0     0                       0.5618109    0.47580  15.3%     -    0s
     0     0    0.47580    0   21    0.56181    0.47580  15.3%     -    0s
     0     0    0.47749    0   22    0.56181    0.47749  15.0%     -    0s
H    0     0                       0.5601245    0.47749  14.8%     -    0s
H    0     0                       0.5564736    0.47749  14.2%     -    0s
     0     2    0.47749    0   22    0.55647    0.47749  14.2%     -    0s
*  190   129              15       0.5556962    0.49105  11.6%  17.6    1s
H  209   136                       0.5554482    0.49286  11.3%  18.0    1s
  1581   294    0.54160   13    8    0.55545    0.51281  7.68%  15.1    5s
H 4698   216                       0.5554482    0.53821  3.10%  14.1    8s

Cutting planes:
  Implied bound: 139
  MIR: 56
  Flow cover: 107
  RLT: 19
  Relax-and-lift: 57

Explored 5398 nodes (74277 simplex iterations) in 9.40 seconds (5.67 work units)
Thread count was 4 (of 48 available processors)

Solution count 10: 0.555448 0.555448 0.555696 ... 0.587525

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

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

        Job resource usage summary 

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

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