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.0714255 seconds.
    local lower bound updated to 0.308667
    local upper bound updated to 0.608893

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.580952
    local lower bound updated to 0.553011

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0791657 seconds.
    local lower bound updated to 0.308667
    local upper bound updated to 0.553011

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.049773 seconds.
    local lower bound updated to 0.553011
    local upper bound updated to 0.553011
The time obtain the optimal randomized assortment is 0.283728 (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_67012.log"
The computation time limit for a lower bound is 85998
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 260 rows, 230 columns and 782 nonzeros
Model fingerprint: 0xe97c1369
Variable types: 189 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [6e-01, 1e+00]
Presolve removed 85 rows and 130 columns
Presolve time: 0.00s
Presolved: 175 rows, 100 columns, 618 nonzeros
Variable types: 68 continuous, 32 integer (32 binary)
Found heuristic solution: objective 0.6698515

Root relaxation: objective 2.894328e-01, 16 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.28943    0    8    0.66985    0.28943  56.8%     -    0s
H    0     0                       0.6357027    0.28943  54.5%     -    0s
H    0     0                       0.6088930    0.34197  43.8%     -    0s
     0     0    0.35326    0   10    0.60889    0.35326  42.0%     -    0s
H    0     0                       0.5891742    0.35326  40.0%     -    0s
     0     0    0.47301    0   12    0.58917    0.47301  19.7%     -    0s
     0     0    0.47302    0   12    0.58917    0.47302  19.7%     -    0s
H    0     0                       0.5749387    0.47302  17.7%     -    0s
H    0     0                       0.5669477    0.47302  16.6%     -    0s
H    0     0                       0.5624591    0.47302  15.9%     -    0s
     0     0    0.51299    0   12    0.56246    0.51299  8.80%     -    0s
H    0     0                       0.5530106    0.51798  6.33%     -    0s
     0     0    0.52093    0   11    0.55301    0.52093  5.80%     -    0s
     0     0    0.52832    0    9    0.55301    0.52832  4.46%     -    0s
     0     0    0.54111    0    9    0.55301    0.54111  2.15%     -    0s

Cutting planes:
  Implied bound: 13
  MIR: 4
  Flow cover: 17
  RLT: 4
  Relax-and-lift: 10

Explored 1 nodes (179 simplex iterations) in 0.05 seconds (0.01 work units)
Thread count was 4 (of 48 available processors)

Solution count 8: 0.553011 0.562459 0.566948 ... 0.669851

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

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

        Job resource usage summary 

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

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