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.0734658 seconds.
    local lower bound updated to 0.435754
    local upper bound updated to 0.624052

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.622217
    local lower bound updated to 0.620383

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0729705 seconds.
    local lower bound updated to 0.435754
    local upper bound updated to 0.620383

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0314648 seconds.
    local lower bound updated to 0.620383
    local upper bound updated to 0.620383
The time obtain the optimal randomized assortment is 0.222643 (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_201812.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 260 rows, 230 columns and 797 nonzeros
Model fingerprint: 0x035cfac7
Variable types: 189 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        [6e-01, 1e+00]
Presolve removed 73 rows and 126 columns
Presolve time: 0.00s
Presolved: 187 rows, 104 columns, 685 nonzeros
Variable types: 72 continuous, 32 integer (32 binary)
Found heuristic solution: objective 0.6582576
Found heuristic solution: objective 0.6449597

Root relaxation: objective 4.902097e-01, 24 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.49021    0   10    0.64496    0.49021  24.0%     -    0s
     0     0    0.53165    0    9    0.64496    0.53165  17.6%     -    0s
H    0     0                       0.6305094    0.53165  15.7%     -    0s
     0     0    0.56503    0   10    0.63051    0.56503  10.4%     -    0s
     0     0    0.56855    0   12    0.63051    0.56855  9.83%     -    0s
H    0     0                       0.6203830    0.56855  8.36%     -    0s
     0     0    0.60905    0   14    0.62038    0.60905  1.83%     -    0s
     0     0    0.61587    0   14    0.62038    0.61587  0.73%     -    0s

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

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

Solution count 4: 0.620383 0.630509 0.64496 0.658258 

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

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

        Job resource usage summary 

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

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