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.0423153 seconds.
    local lower bound updated to 0.245723
    local upper bound updated to 0.479093

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.615573
    local lower bound updated to 0.592032

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0798315 seconds.
    local lower bound updated to 0.35493
    local upper bound updated to 0.488646

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0482646 seconds.
    local lower bound updated to 0.469646
    local upper bound updated to 0.479365

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.0845779 seconds.
    local lower bound updated to 0.473133
    local upper bound updated to 0.473453

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.117937 seconds.
    local lower bound updated to 0.473453
    local upper bound updated to 0.473453
The Primal step takes 0.337216 (S)
lower bound updated to 0.473453

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.543035
    local lower bound updated to 0.479959

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.507031
    local lower bound updated to 0.487831

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.507031
    local lower bound updated to 0.499623

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.500373
    local lower bound updated to 0.500315

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.346363 seconds.
    local lower bound updated to 0.421372
    local upper bound updated to 0.498578

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.409498 seconds.
    local lower bound updated to 0.492829
    local upper bound updated to 0.4983

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.467349 seconds.
    local lower bound updated to 0.494543
    local upper bound updated to 0.497098

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.420466 seconds.
    local lower bound updated to 0.494543
    local upper bound updated to 0.496406

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.383964 seconds.
    local lower bound updated to 0.494543
    local upper bound updated to 0.496257

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 0.472758 seconds.
    local lower bound updated to 0.496144
    local upper bound updated to 0.496253

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 0.463725 seconds.
    local lower bound updated to 0.496144
    local upper bound updated to 0.49623

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 0.461368 seconds.
    local lower bound updated to 0.49623
    local upper bound updated to 0.49623
The Primal step takes 3.45091 (S)
lower bound updated to 0.49623

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.537042
    local lower bound updated to 0.49623

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.508408
    local lower bound updated to 0.496283

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.362586 seconds.
    local lower bound updated to 0.421539
    local upper bound updated to 0.496283

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.400725 seconds.
    local lower bound updated to 0.495203
    local upper bound updated to 0.496263

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.442595 seconds.
    local lower bound updated to 0.496088
    local upper bound updated to 0.496258

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.449326 seconds.
    local lower bound updated to 0.496094
    local upper bound updated to 0.49623

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.415895 seconds.
    local lower bound updated to 0.49623
    local upper bound updated to 0.49623
The Primal step takes 2.08904 (S)
lower bound updated to 0.49623

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.538775
    local lower bound updated to 0.49623

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.334852 seconds.
    local lower bound updated to 0.421539
    local upper bound updated to 0.49623

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.459744 seconds.
    local lower bound updated to 0.49623
    local upper bound updated to 0.49623
The time obtain the optimal randomized assortment is 7.55376 (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_208612.log"
The computation time limit for a lower bound is 85991
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 904 rows, 888 columns and 2758 nonzeros
Model fingerprint: 0x4c44f50e
Variable types: 847 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        [2e-01, 1e+00]
Presolve removed 325 rows and 623 columns
Presolve time: 0.01s
Presolved: 579 rows, 265 columns, 2112 nonzeros
Variable types: 227 continuous, 38 integer (38 binary)
Found heuristic solution: objective 0.6832018
Found heuristic solution: objective 0.5942237

Root relaxation: objective 3.498509e-01, 97 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.34985    0   10    0.59422    0.34985  41.1%     -    0s
H    0     0                       0.5376699    0.34985  34.9%     -    0s
H    0     0                       0.5300288    0.37170  29.9%     -    0s
     0     0    0.37887    0   14    0.53003    0.37887  28.5%     -    0s
H    0     0                       0.5020369    0.37887  24.5%     -    0s
     0     0    0.38151    0   14    0.50204    0.38151  24.0%     -    0s
H    0     0                       0.4965135    0.38151  23.2%     -    0s
     0     0    0.40662    0   16    0.49651    0.40662  18.1%     -    0s
     0     0    0.40674    0   16    0.49651    0.40674  18.1%     -    0s
     0     0    0.41494    0   15    0.49651    0.41494  16.4%     -    0s
     0     0    0.41504    0   15    0.49651    0.41504  16.4%     -    0s
     0     0    0.43168    0   14    0.49651    0.43168  13.1%     -    0s
     0     0    0.43234    0   15    0.49651    0.43234  12.9%     -    0s
     0     0    0.44024    0   14    0.49651    0.44024  11.3%     -    0s
H    0     0                       0.4964508    0.44024  11.3%     -    0s
     0     2    0.44024    0   14    0.49645    0.44024  11.3%     -    0s
H   26    19                       0.4962296    0.46320  6.66%  17.7    0s

Cutting planes:
  Implied bound: 73
  MIR: 18
  Flow cover: 49
  RLT: 8
  Relax-and-lift: 34

Explored 105 nodes (2058 simplex iterations) in 0.46 seconds (0.14 work units)
Thread count was 4 (of 48 available processors)

Solution count 8: 0.49623 0.496451 0.496514 ... 0.683202

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

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

        Job resource usage summary 

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

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