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.0548113 seconds.
    local lower bound updated to 0.235432
    local upper bound updated to 0.458544

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.546132
    local lower bound updated to 0.542177

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.543919
    local lower bound updated to 0.543795

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.284783 seconds.
    local lower bound updated to 0.284597
    local upper bound updated to 0.457955

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.22824 seconds.
    local lower bound updated to 0.456939
    local upper bound updated to 0.457533

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.476322
    local lower bound updated to 0.469114

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.476322
    local lower bound updated to 0.469654

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.49567 seconds.
    local lower bound updated to 0.343011
    local upper bound updated to 0.469654

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.339042 seconds.
    local lower bound updated to 0.435265
    local upper bound updated to 0.466328

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.391627 seconds.
    local lower bound updated to 0.446051
    local upper bound updated to 0.461549

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.380313 seconds.
    local lower bound updated to 0.456132
    local upper bound updated to 0.459205

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.333355 seconds.
    local lower bound updated to 0.45895
    local upper bound updated to 0.45912

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.472826
    local lower bound updated to 0.463035

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.467655
    local lower bound updated to 0.463743

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.465148
    local lower bound updated to 0.464153

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.464678
    local lower bound updated to 0.464153

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.988146 seconds.
    local lower bound updated to 0.38588
    local upper bound updated to 0.464153

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.785471 seconds.
    local lower bound updated to 0.45782
    local upper bound updated to 0.463757

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 1.20597 seconds.
    local lower bound updated to 0.461374
    local upper bound updated to 0.463103

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 1.73229 seconds.
    local lower bound updated to 0.462926
    local upper bound updated to 0.463098

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 1.37593 seconds.
    local lower bound updated to 0.462926
    local upper bound updated to 0.463054

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 1.90632 seconds.
    local lower bound updated to 0.463018
    local upper bound updated to 0.463047

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.471068
    local lower bound updated to 0.463047

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.471068
    local lower bound updated to 0.463056

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.790741 seconds.
    local lower bound updated to 0.383904
    local upper bound updated to 0.463056

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 1.92983 seconds.
    local lower bound updated to 0.462912
    local upper bound updated to 0.463047

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 1.84262 seconds.
    local lower bound updated to 0.463047
    local upper bound updated to 0.463047
The time obtain the optimal randomized assortment is 21.9016 (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_13_4_100.000000_103414.log"
The computation time limit for a lower bound is 85977
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 1464 rows, 1282 columns and 4566 nonzeros
Model fingerprint: 0x1cbed6b5
Variable types: 1233 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [1e-02, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 494 rows and 842 columns
Presolve time: 0.01s
Presolved: 970 rows, 440 columns, 3651 nonzeros
Variable types: 393 continuous, 47 integer (47 binary)
Found heuristic solution: objective 0.5527051
Found heuristic solution: objective 0.5305211
Found heuristic solution: objective 0.5244371

Root relaxation: objective 3.721390e-01, 119 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.37214    0   17    0.52444    0.37214  29.0%     -    0s
H    0     0                       0.5115463    0.37214  27.3%     -    0s
H    0     0                       0.4656522    0.37214  20.1%     -    0s
     0     0    0.38837    0   20    0.46565    0.38837  16.6%     -    0s
     0     0    0.38837    0   20    0.46565    0.38837  16.6%     -    0s
     0     0    0.41207    0   18    0.46565    0.41207  11.5%     -    0s
H    0     0                       0.4653450    0.41207  11.4%     -    0s
     0     0    0.41289    0   19    0.46535    0.41289  11.3%     -    0s
     0     0    0.42155    0   23    0.46535    0.42155  9.41%     -    0s
     0     0    0.42178    0   22    0.46535    0.42178  9.36%     -    0s
H    0     0                       0.4647779    0.42178  9.25%     -    0s
H    0     0                       0.4637924    0.42314  8.76%     -    0s
     0     0    0.42314    0   20    0.46379    0.42314  8.76%     -    0s
     0     0    0.42367    0   20    0.46379    0.42367  8.65%     -    0s
     0     0    0.42371    0   19    0.46379    0.42371  8.64%     -    0s
H    0     0                       0.4630471    0.42371  8.50%     -    0s
     0     2    0.42371    0   19    0.46305    0.42371  8.50%     -    0s
H  838    86                       0.4630470    0.45261  2.26%  12.6    1s
H  893    81                       0.4630470    0.45388  1.98%  12.7    1s

Cutting planes:
  Implied bound: 134
  MIR: 40
  Flow cover: 107
  RLT: 13
  Relax-and-lift: 67

Explored 1145 nodes (14752 simplex iterations) in 1.93 seconds (1.25 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.463047 0.463047 0.463792 ... 0.552705

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

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

        Job resource usage summary 

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

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