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.0250717 seconds.
    local lower bound updated to 0.241995
    local upper bound updated to 0.476687

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.501076
    local lower bound updated to 0.481535

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.491653
    local lower bound updated to 0.489743

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.491606
    local lower bound updated to 0.491294

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.491294
    local lower bound updated to 0.491294
The Dual step takes 0.0444272 (S)
upper bound updated to 0.491294
*** OUTER ITERATION 1 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0972195 seconds.
    local lower bound updated to 0.374143
    local upper bound updated to 0.475841

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0597242 seconds.
    local lower bound updated to 0.474659
    local upper bound updated to 0.4749

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.0610244 seconds.
    local lower bound updated to 0.474659
    local upper bound updated to 0.474856

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.055533 seconds.
    local lower bound updated to 0.474659
    local upper bound updated to 0.474671

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.486499
    local lower bound updated to 0.474671

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0747934 seconds.
    local lower bound updated to 0.374143
    local upper bound updated to 0.474671

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0642113 seconds.
    local lower bound updated to 0.474671
    local upper bound updated to 0.474671
The time obtain the optimal randomized assortment is 0.654992 (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_208812.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: 20 physical cores, 40 logical processors, using up to 4 threads
Optimize a model with 536 rows, 512 columns and 1619 nonzeros
Model fingerprint: 0x32bb5f71
Variable types: 471 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [1e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 207 rows and 345 columns
Presolve time: 0.01s
Presolved: 329 rows, 167 columns, 1177 nonzeros
Variable types: 131 continuous, 36 integer (36 binary)
Found heuristic solution: objective 0.5115282

Root relaxation: objective 4.431926e-01, 57 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.44319    0   10    0.51153    0.44319  13.4%     -    0s
H    0     0                       0.4959502    0.45106  9.05%     -    0s
     0     0    0.45106    0   14    0.49595    0.45106  9.05%     -    0s
H    0     0                       0.4770344    0.45106  5.44%     -    0s
     0     0    0.45106    0   14    0.47703    0.45106  5.44%     -    0s
     0     0    0.46633    0   15    0.47703    0.46633  2.24%     -    0s
H    0     0                       0.4746710    0.46707  1.60%     -    0s
     0     0    0.46824    0   14    0.47467    0.46824  1.35%     -    0s
     0     0    0.47467    0    9    0.47467    0.47467  0.00%     -    0s

Cutting planes:
  Gomory: 2
  Implied bound: 46
  MIR: 7
  Flow cover: 21
  RLT: 8
  Relax-and-lift: 18

Explored 1 nodes (333 simplex iterations) in 0.07 seconds (0.01 work units)
Thread count was 4 (of 40 available processors)

Solution count 4: 0.474671 0.477034 0.49595 0.511528 

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

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

        Job resource usage summary 

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

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