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.128136 seconds.
    local lower bound updated to 0.200722
    local upper bound updated to 0.390839

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0845336 seconds.
    local lower bound updated to 0.260444
    local upper bound updated to 0.393716

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.191365 seconds.
    local lower bound updated to 0.390308
    local upper bound updated to 0.391318

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.407528
    local lower bound updated to 0.392957

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.392957
    local lower bound updated to 0.392957
The Dual step takes 0.0561978 (S)
upper bound updated to 0.392957
*** OUTER ITERATION 2 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.333705 seconds.
    local lower bound updated to 0.281034
    local upper bound updated to 0.392957

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.247525 seconds.
    local lower bound updated to 0.387137
    local upper bound updated to 0.391318

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.393712
    local lower bound updated to 0.391318

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.294767 seconds.
    local lower bound updated to 0.281034
    local upper bound updated to 0.391318

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.174818 seconds.
    local lower bound updated to 0.391318
    local upper bound updated to 0.391318
The time obtain the optimal randomized assortment is 2.13787 (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_62014.log"
The computation time limit for a lower bound is 85996
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 582 rows, 498 columns and 1864 nonzeros
Model fingerprint: 0xdf8160de
Variable types: 449 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [9e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 158 rows and 280 columns
Presolve time: 0.01s
Presolved: 424 rows, 218 columns, 1601 nonzeros
Variable types: 173 continuous, 45 integer (45 binary)
Found heuristic solution: objective 0.6351673
Found heuristic solution: objective 0.6324485
Found heuristic solution: objective 0.4373955

Root relaxation: objective 2.555271e-01, 53 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.25553    0   14    0.43740    0.25553  41.6%     -    0s
     0     0    0.26050    0   14    0.43740    0.26050  40.4%     -    0s
     0     0    0.30699    0   19    0.43740    0.30699  29.8%     -    0s
H    0     0                       0.4124036    0.30699  25.6%     -    0s
H    0     0                       0.3913176    0.30699  21.6%     -    0s
H    0     0                       0.3913176    0.30699  21.6%     -    0s
     0     0    0.36913    0   14    0.39132    0.36913  5.67%     -    0s
     0     0    0.37072    0   15    0.39132    0.37072  5.26%     -    0s
     0     0    0.37497    0   18    0.39132    0.37497  4.18%     -    0s
     0     0    0.37653    0   18    0.39132    0.37653  3.78%     -    0s
     0     0    0.38273    0   14    0.39132    0.38273  2.19%     -    0s
     0     2    0.38273    0   14    0.39132    0.38273  2.19%     -    0s

Cutting planes:
  Implied bound: 51
  MIR: 7
  Flow cover: 24
  RLT: 7
  Relax-and-lift: 23

Explored 16 nodes (579 simplex iterations) in 0.19 seconds (0.06 work units)
Thread count was 4 (of 48 available processors)

Solution count 6: 0.391318 0.391318 0.412404 ... 0.635167

Optimal solution found (tolerance 1.00e-04)
Best objective 3.913175537693e-01, best bound 3.913155217056e-01, gap 0.0005%
The objective bound is 0.391316 while the objective upper bound is 0.391318

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

        Job resource usage summary 

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

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