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.688588 seconds.
    local lower bound updated to 0.400761
    local upper bound updated to 0.688608

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.731687
    local lower bound updated to 0.728787

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.35477 seconds.
    local lower bound updated to 0.488619
    local upper bound updated to 0.696187

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 3.11404 seconds.
    local lower bound updated to 0.685183
    local upper bound updated to 0.689006

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 1.78938 seconds.
    local lower bound updated to 0.688752
    local upper bound updated to 0.688855

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.701664
    local lower bound updated to 0.690122

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.697275
    local lower bound updated to 0.694078

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.697275
    local lower bound updated to 0.69442

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 10.1275 seconds.
    local lower bound updated to 0.586763
    local upper bound updated to 0.69442

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 2.14281 seconds.
    local lower bound updated to 0.68871
    local upper bound updated to 0.693732

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 2.91168 seconds.
    local lower bound updated to 0.6933
    local upper bound updated to 0.693732

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 5.37887 seconds.
    local lower bound updated to 0.693418
    local upper bound updated to 0.693731

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.700453
    local lower bound updated to 0.693731

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 10.4359 seconds.
    local lower bound updated to 0.586763
    local upper bound updated to 0.693731

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 7.5924 seconds.
    local lower bound updated to 0.693731
    local upper bound updated to 0.693731
The time obtain the optimal randomized assortment is 58.1046 (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_60.000000_69318.log"
The computation time limit for a lower bound is 85936
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 128 physical cores, 256 logical processors, using up to 4 threads
Optimize a model with 1246 rows, 954 columns and 4104 nonzeros
Model fingerprint: 0x9913e0ba
Variable types: 889 continuous, 65 integer (65 binary)
Coefficient statistics:
  Matrix range     [3e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [6e-01, 1e+00]
Presolve removed 293 rows and 496 columns
Presolve time: 0.01s
Presolved: 953 rows, 458 columns, 3687 nonzeros
Variable types: 400 continuous, 58 integer (58 binary)
Found heuristic solution: objective 0.8268434
Found heuristic solution: objective 0.7923113

Root relaxation: objective 6.166469e-01, 108 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.61665    0   10    0.79231    0.61665  22.2%     -    0s
H    0     0                       0.7692185    0.61665  19.8%     -    0s
H    0     0                       0.7457061    0.61744  17.2%     -    0s
     0     0    0.61744    0   16    0.74571    0.61744  17.2%     -    0s
H    0     0                       0.7385608    0.61744  16.4%     -    0s
H    0     0                       0.7356275    0.63188  14.1%     -    0s
     0     0    0.63188    0   22    0.73563    0.63188  14.1%     -    0s
H    0     0                       0.7344065    0.63188  14.0%     -    0s
     0     0    0.63188    0   22    0.73441    0.63188  14.0%     -    0s
H    0     0                       0.7304292    0.63670  12.8%     -    0s
     0     0    0.63670    0   26    0.73043    0.63670  12.8%     -    0s
H    0     0                       0.7120456    0.63670  10.6%     -    0s
     0     0    0.63757    0   26    0.71205    0.63757  10.5%     -    0s
     0     0    0.64412    0   28    0.71205    0.64412  9.54%     -    0s
     0     0    0.64470    0   28    0.71205    0.64470  9.46%     -    0s
H    0     0                       0.7085168    0.64470  9.01%     -    0s
     0     0    0.64761    0   28    0.70852    0.64761  8.60%     -    0s
H    0     0                       0.6957206    0.64761  6.92%     -    0s
H    0     0                       0.6955836    0.64761  6.90%     -    0s
H    0     0                       0.6937312    0.64761  6.65%     -    0s
     0     2    0.64761    0   28    0.69373    0.64761  6.65%     -    0s
H 5000   716                       0.6937312    0.67714  2.39%  14.6    4s
  5684   690    0.68128   17   12    0.69373    0.67857  2.19%  14.5    5s

Cutting planes:
  Implied bound: 164
  MIR: 30
  Flow cover: 102
  RLT: 11
  Relax-and-lift: 79

Explored 9431 nodes (135187 simplex iterations) in 6.90 seconds (7.52 work units)
Thread count was 4 (of 256 available processors)

Solution count 10: 0.693731 0.693731 0.695584 ... 0.738561

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

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

        Job resource usage summary 

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

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