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.241185 seconds.
    local lower bound updated to 0.243028
    local upper bound updated to 0.459316

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.477804
    local lower bound updated to 0.468634

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.469853
    local lower bound updated to 0.469499

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.363682 seconds.
    local lower bound updated to 0.345107
    local upper bound updated to 0.461421

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.407938 seconds.
    local lower bound updated to 0.460321
    local upper bound updated to 0.46111

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.312998 seconds.
    local lower bound updated to 0.461097
    local upper bound updated to 0.461098
The Primal step takes 1.09082 (S)
lower bound updated to 0.461097

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.464688
    local lower bound updated to 0.461098

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.319426 seconds.
    local lower bound updated to 0.345107
    local upper bound updated to 0.461098

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.239362 seconds.
    local lower bound updated to 0.461098
    local upper bound updated to 0.461098
The time obtain the optimal randomized assortment is 2.1501 (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_200.000000_201814.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: 20 physical cores, 40 logical processors, using up to 4 threads
Optimize a model with 582 rows, 498 columns and 1810 nonzeros
Model fingerprint: 0xc6a2ec3f
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 179 rows and 295 columns
Presolve time: 0.01s
Presolved: 403 rows, 203 columns, 1522 nonzeros
Variable types: 158 continuous, 45 integer (45 binary)
Found heuristic solution: objective 0.5689712
Found heuristic solution: objective 0.5223508

Root relaxation: objective 3.539224e-01, 52 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.35392    0   11    0.52235    0.35392  32.2%     -    0s
H    0     0                       0.5015565    0.35453  29.3%     -    0s
     0     0    0.39775    0   16    0.50156    0.39775  20.7%     -    0s
H    0     0                       0.4968620    0.39775  19.9%     -    0s
     0     0    0.39984    0   16    0.49686    0.39984  19.5%     -    0s
H    0     0                       0.4947681    0.39984  19.2%     -    0s
     0     0    0.40653    0   23    0.49477    0.40653  17.8%     -    0s
     0     0    0.41171    0   24    0.49477    0.41171  16.8%     -    0s
H    0     0                       0.4637902    0.43376  6.47%     -    0s
     0     0    0.43376    0   17    0.46379    0.43376  6.47%     -    0s
H    0     0                       0.4611530    0.43376  5.94%     -    0s
     0     0    0.43438    0   17    0.46115    0.43438  5.81%     -    0s
     0     0    0.43708    0   19    0.46115    0.43708  5.22%     -    0s
     0     0    0.43708    0   24    0.46115    0.43708  5.22%     -    0s
     0     0    0.44239    0   16    0.46115    0.44239  4.07%     -    0s
H    0     0                       0.4611458    0.44239  4.07%     -    0s
     0     2    0.44239    0   16    0.46115    0.44239  4.07%     -    0s
*   44     5              10       0.4610976    0.45616  1.07%  11.9    0s

Cutting planes:
  Implied bound: 38
  MIR: 16
  Flow cover: 42
  RLT: 1
  Relax-and-lift: 16

Explored 56 nodes (1247 simplex iterations) in 0.27 seconds (0.08 work units)
Thread count was 4 (of 40 available processors)

Solution count 9: 0.461098 0.461146 0.461153 ... 0.568971

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

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

        Job resource usage summary 

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

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