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.024226 seconds.
    local lower bound updated to 0.295089
    local upper bound updated to 0.565295

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.217504 seconds.
    local lower bound updated to 0.372749
    local upper bound updated to 0.566974

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0693483 seconds.
    local lower bound updated to 0.564243
    local upper bound updated to 0.565295

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.607659
    local lower bound updated to 0.565295

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.100144 seconds.
    local lower bound updated to 0.399734
    local upper bound updated to 0.565295

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0630608 seconds.
    local lower bound updated to 0.565295
    local upper bound updated to 0.565295
The time obtain the optimal randomized assortment is 0.62143 (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_13_4_60.000000_67414.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 582 rows, 498 columns and 1829 nonzeros
Model fingerprint: 0x0da76e08
Variable types: 449 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [3e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 159 rows and 285 columns
Presolve time: 0.00s
Presolved: 423 rows, 213 columns, 1577 nonzeros
Variable types: 169 continuous, 44 integer (44 binary)
Found heuristic solution: objective 0.7371203
Found heuristic solution: objective 0.5901048

Root relaxation: objective 4.876024e-01, 56 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.48760    0   12    0.59010    0.48760  17.4%     -    0s
     0     0    0.49846    0   16    0.59010    0.49846  15.5%     -    0s
     0     0    0.49927    0   16    0.59010    0.49927  15.4%     -    0s
     0     0    0.54670    0   13    0.59010    0.54670  7.35%     -    0s
H    0     0                       0.5679037    0.54681  3.72%     -    0s
     0     0    0.54772    0   12    0.56790    0.54772  3.55%     -    0s
H    0     0                       0.5652952    0.54772  3.11%     -    0s
     0     0    0.56202    0   13    0.56530    0.56202  0.58%     -    0s
     0     0    0.56530    0   12    0.56530    0.56530  0.00%     -    0s

Cutting planes:
  Gomory: 1
  Implied bound: 57
  MIR: 4
  Flow cover: 18
  Relax-and-lift: 25

Explored 1 nodes (410 simplex iterations) in 0.06 seconds (0.02 work units)
Thread count was 4 (of 40 available processors)

Solution count 4: 0.565295 0.567904 0.590105 0.73712 

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

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

        Job resource usage summary 

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

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