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.158435 seconds.
    local lower bound updated to 0.259037
    local upper bound updated to 0.514338

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.675586
    local lower bound updated to 0.674027

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.307336 seconds.
    local lower bound updated to 0.267243
    local upper bound updated to 0.514904

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.2701 seconds.
    local lower bound updated to 0.5121
    local upper bound updated to 0.512334

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.561269
    local lower bound updated to 0.512334

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.549413
    local lower bound updated to 0.518097

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.386603 seconds.
    local lower bound updated to 0.326718
    local upper bound updated to 0.518097

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.357708 seconds.
    local lower bound updated to 0.514365
    local upper bound updated to 0.514629

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.360047 seconds.
    local lower bound updated to 0.514365
    local upper bound updated to 0.514503

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.330129 seconds.
    local lower bound updated to 0.514365
    local upper bound updated to 0.514451

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.535032
    local lower bound updated to 0.515428

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.499298 seconds.
    local lower bound updated to 0.356236
    local upper bound updated to 0.515428

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.415694 seconds.
    local lower bound updated to 0.512675
    local upper bound updated to 0.515082

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.58041 seconds.
    local lower bound updated to 0.513971
    local upper bound updated to 0.515029

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.424767 seconds.
    local lower bound updated to 0.514175
    local upper bound updated to 0.514451

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.524068
    local lower bound updated to 0.514451

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.485524 seconds.
    local lower bound updated to 0.356236
    local upper bound updated to 0.514451

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.421521 seconds.
    local lower bound updated to 0.514451
    local upper bound updated to 0.514451
The time obtain the optimal randomized assortment is 6.57343 (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_11_4_60.000000_60812.log"
The computation time limit for a lower bound is 85992
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 676 rows, 606 columns and 2058 nonzeros
Model fingerprint: 0x9a866ae6
Variable types: 565 continuous, 41 integer (41 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 243 rows and 397 columns
Presolve time: 0.01s
Presolved: 433 rows, 209 columns, 1602 nonzeros
Variable types: 171 continuous, 38 integer (38 binary)
Found heuristic solution: objective 0.5946279
Found heuristic solution: objective 0.5350236

Root relaxation: objective 4.203611e-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.42036    0   12    0.53502    0.42036  21.4%     -    0s
H    0     0                       0.5185935    0.42036  18.9%     -    0s
     0     0    0.44863    0   19    0.51859    0.44863  13.5%     -    0s
H    0     0                       0.5180788    0.44863  13.4%     -    0s
H    0     0                       0.5144509    0.44863  12.8%     -    0s
     0     0    0.47062    0   18    0.51445    0.47062  8.52%     -    0s
     0     0    0.47369    0   18    0.51445    0.47369  7.92%     -    0s
     0     0    0.48407    0   16    0.51445    0.48407  5.91%     -    0s
     0     0    0.48658    0   13    0.51445    0.48658  5.42%     -    0s
     0     0    0.48768    0   12    0.51445    0.48768  5.20%     -    0s
     0     0    0.48835    0   13    0.51445    0.48835  5.07%     -    0s
     0     0    0.49153    0   13    0.51445    0.49153  4.45%     -    0s
     0     2    0.49153    0   13    0.51445    0.49153  4.45%     -    0s

Cutting planes:
  Implied bound: 48
  MIR: 15
  Flow cover: 20
  RLT: 8
  Relax-and-lift: 28

Explored 83 nodes (1427 simplex iterations) in 0.43 seconds (0.11 work units)
Thread count was 4 (of 48 available processors)

Solution count 5: 0.514451 0.518079 0.518593 ... 0.594628

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

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

        Job resource usage summary 

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

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