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.0576118 seconds.
    local lower bound updated to 0.299555
    local upper bound updated to 0.582211

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.101755 seconds.
    local lower bound updated to 0.375707
    local upper bound updated to 0.585192

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.168753 seconds.
    local lower bound updated to 0.578733
    local upper bound updated to 0.582211

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.584594
    local lower bound updated to 0.582211

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.286322 seconds.
    local lower bound updated to 0.426727
    local upper bound updated to 0.582211

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.15872 seconds.
    local lower bound updated to 0.582211
    local upper bound updated to 0.582211
The time obtain the optimal randomized assortment is 1.10409 (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_68412.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: 128 physical cores, 128 logical processors, using up to 4 threads
Optimize a model with 444 rows, 418 columns and 1363 nonzeros
Model fingerprint: 0x19f06f9d
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [1e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 156 rows and 268 columns
Presolve time: 0.01s
Presolved: 288 rows, 150 columns, 1072 nonzeros
Variable types: 113 continuous, 37 integer (37 binary)
Found heuristic solution: objective 0.7290214
Found heuristic solution: objective 0.6737296

Root relaxation: objective 4.392867e-01, 38 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.43929    0   11    0.67373    0.43929  34.8%     -    0s
H    0     0                       0.6552851    0.46095  29.7%     -    0s
H    0     0                       0.6324157    0.46095  27.1%     -    0s
     0     0    0.46543    0   14    0.63242    0.46543  26.4%     -    0s
H    0     0                       0.5894267    0.46543  21.0%     -    0s
     0     0    0.48482    0   13    0.58943    0.48482  17.7%     -    0s
     0     0    0.53826    0   12    0.58943    0.53826  8.68%     -    0s
H    0     0                       0.5869378    0.53826  8.29%     -    0s
     0     0    0.55177    0   12    0.58694    0.55177  5.99%     -    0s
H    0     0                       0.5832798    0.55177  5.40%     -    0s
     0     0    0.56211    0   12    0.58328    0.56211  3.63%     -    0s
     0     0    0.56316    0   10    0.58328    0.56316  3.45%     -    0s
H    0     0                       0.5822106    0.56316  3.27%     -    0s
     0     0    0.57239    0    9    0.58221    0.57239  1.69%     -    0s
     0     0    0.58221    0   10    0.58221    0.58221  0.00%     -    0s

Cutting planes:
  Implied bound: 17
  MIR: 6
  Flow cover: 29
  RLT: 4
  Relax-and-lift: 7

Explored 1 nodes (382 simplex iterations) in 0.12 seconds (0.02 work units)
Thread count was 4 (of 128 available processors)

Solution count 8: 0.582211 0.58328 0.586938 ... 0.729021

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

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

        Job resource usage summary 

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

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