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.117373 seconds.
    local lower bound updated to 0.287572
    local upper bound updated to 0.52154

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.538398
    local lower bound updated to 0.524087

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.525792
    local lower bound updated to 0.525506

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.246243 seconds.
    local lower bound updated to 0.406154
    local upper bound updated to 0.524087

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0540152 seconds.
    local lower bound updated to 0.513034
    local upper bound updated to 0.523762

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.163725 seconds.
    local lower bound updated to 0.516441
    local upper bound updated to 0.523078

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.171731 seconds.
    local lower bound updated to 0.520693
    local upper bound updated to 0.521425

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.0704588 seconds.
    local lower bound updated to 0.521059
    local upper bound updated to 0.52122

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.533574
    local lower bound updated to 0.52122

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.215212 seconds.
    local lower bound updated to 0.406154
    local upper bound updated to 0.52122

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0617818 seconds.
    local lower bound updated to 0.52122
    local upper bound updated to 0.52122
The time obtain the optimal randomized assortment is 1.37357 (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_200.000000_207212.log"
The computation time limit for a lower bound is 85997
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 444 rows, 418 columns and 1351 nonzeros
Model fingerprint: 0xd77f7357
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [3e-02, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 154 rows and 268 columns
Presolve time: 0.00s
Presolved: 290 rows, 150 columns, 1048 nonzeros
Variable types: 113 continuous, 37 integer (37 binary)
Found heuristic solution: objective 0.6219144

Root relaxation: objective 4.016133e-01, 50 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.40161    0   10    0.62191    0.40161  35.4%     -    0s
H    0     0                       0.5766077    0.41186  28.6%     -    0s
     0     0    0.42112    0   13    0.57661    0.42112  27.0%     -    0s
H    0     0                       0.5757472    0.42112  26.9%     -    0s
     0     0    0.43612    0   13    0.57575    0.43612  24.3%     -    0s
     0     0    0.44202    0   12    0.57575    0.44202  23.2%     -    0s
H    0     0                       0.5315741    0.44202  16.8%     -    0s
     0     0    0.48154    0   13    0.53157    0.48154  9.41%     -    0s
H    0     0                       0.5313180    0.48260  9.17%     -    0s
     0     0    0.49351    0   12    0.53132    0.49351  7.12%     -    0s
H    0     0                       0.5215546    0.49351  5.38%     -    0s
H    0     0                       0.5214017    0.49351  5.35%     -    0s
H    0     0                       0.5212200    0.49351  5.32%     -    0s
     0     0    0.50644    0    8    0.52122    0.50644  2.84%     -    0s
     0     0    0.52122    0    8    0.52122    0.52122  0.00%     -    0s

Cutting planes:
  Implied bound: 26
  MIR: 8
  Flow cover: 21
  RLT: 4
  Relax-and-lift: 9

Explored 1 nodes (311 simplex iterations) in 0.07 seconds (0.02 work units)
Thread count was 4 (of 48 available processors)

Solution count 8: 0.52122 0.521402 0.521555 ... 0.621914

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

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

        Job resource usage summary 

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

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