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 12.1129 seconds.
    local lower bound updated to 0.28372
    local upper bound updated to 0.53741

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.645879
    local lower bound updated to 0.634212

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 3.6762 seconds.
    local lower bound updated to 0.362352
    local upper bound updated to 0.54195

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 32.3364 seconds.
    local lower bound updated to 0.529687
    local upper bound updated to 0.534321

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 62.3018 seconds.
    local lower bound updated to 0.530228
    local upper bound updated to 0.532923

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 47.3302 seconds.
    local lower bound updated to 0.530928
    local upper bound updated to 0.53252

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.567534
    local lower bound updated to 0.545047

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 8.12123 seconds.
    local lower bound updated to 0.392797
    local upper bound updated to 0.544026

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 46.8347 seconds.
    local lower bound updated to 0.542981
    local upper bound updated to 0.543452

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 57.054 seconds.
    local lower bound updated to 0.542981
    local upper bound updated to 0.543383

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.554624
    local lower bound updated to 0.543383

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.548857
    local lower bound updated to 0.543612

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 8.67376 seconds.
    local lower bound updated to 0.414871
    local upper bound updated to 0.543612

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 68.808 seconds.
    local lower bound updated to 0.542376
    local upper bound updated to 0.54341

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.556322
    local lower bound updated to 0.54341

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 26.8975 seconds.
    local lower bound updated to 0.427628
    local upper bound updated to 0.54341

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 100.024 seconds.
    local lower bound updated to 0.54341
    local upper bound updated to 0.54341
The time obtain the optimal randomized assortment is 660.314 (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_17_4_100.000000_102618.log"
The computation time limit for a lower bound is 85310
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 1440 rows, 1102 columns and 4739 nonzeros
Model fingerprint: 0xcea3bd0b
Variable types: 1037 continuous, 65 integer (65 binary)
Coefficient statistics:
  Matrix range     [2e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 317 rows and 567 columns
Presolve time: 0.02s
Presolved: 1123 rows, 535 columns, 4320 nonzeros
Variable types: 474 continuous, 61 integer (61 binary)
Found heuristic solution: objective 0.6675042
Found heuristic solution: objective 0.6272234
Found heuristic solution: objective 0.6230158

Root relaxation: objective 4.028545e-01, 145 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.40285    0   14    0.62302    0.40285  35.3%     -    0s
H    0     0                       0.6024531    0.40285  33.1%     -    0s
H    0     0                       0.5813590    0.40285  30.7%     -    0s
     0     0    0.40305    0   28    0.58136    0.40305  30.7%     -    0s
H    0     0                       0.5712516    0.40305  29.4%     -    0s
     0     0    0.44322    0   28    0.57125    0.44322  22.4%     -    0s
     0     0    0.44929    0   28    0.57125    0.44929  21.3%     -    0s
H    0     0                       0.5570938    0.44929  19.4%     -    0s
     0     0    0.44967    0   27    0.55709    0.44967  19.3%     -    0s
     0     0    0.45520    0   30    0.55709    0.45520  18.3%     -    0s
     0     0    0.45665    0   30    0.55709    0.45665  18.0%     -    0s
     0     0    0.45799    0   27    0.55709    0.45799  17.8%     -    0s
H    0     0                       0.5488830    0.45799  16.6%     -    0s
H    0     0                       0.5450488    0.45799  16.0%     -    2s
     0     2    0.45799    0   27    0.54505    0.45799  16.0%     -    2s
H   17    20                       0.5434097    0.46551  14.3%  37.6    2s
   686   278    0.47946    9   15    0.54341    0.47753  12.1%  14.4    5s
  2716   733    0.54277   14    6    0.54341    0.48404  10.9%  13.0   10s
  4044   838    0.49231   20   17    0.54341    0.48613  10.5%  15.0   15s
  5381   737    0.50779   18   21    0.54341    0.49238  9.39%  16.6   20s
  6998   755    0.52569   23   17    0.54341    0.49780  8.39%  18.0   25s
  8157   892    0.53066   23    8    0.54341    0.50123  7.76%  18.4   30s
  9322   988    0.52975   23   10    0.54341    0.50446  7.17%  18.5   35s
 10202  1076 infeasible   24         0.54341    0.50719  6.67%  18.6   40s
 12337  1253    0.51415   20   16    0.54341    0.51154  5.86%  18.5   45s
 14252  1305    0.52340   20   18    0.54341    0.51430  5.36%  18.4   50s
 15851  1306    0.52242   22   15    0.54341    0.51705  4.85%  18.1   56s
 17100  1304    0.52845   24   12    0.54341    0.51881  4.53%  18.0   60s
 19205  1275     cutoff   24         0.54341    0.52136  4.06%  17.9   65s
 21038  1211    0.53132   25   13    0.54341    0.52417  3.54%  17.7   70s
 23232  1040    0.53809   24   12    0.54341    0.52592  3.22%  17.5   75s
 24864   895 infeasible   27         0.54341    0.52760  2.91%  17.4   80s
 26890   654    0.54007   25   12    0.54341    0.53046  2.38%  17.2   85s

Cutting planes:
  Implied bound: 104
  MIR: 95
  Flow cover: 203
  RLT: 29
  Relax-and-lift: 53

Explored 28849 nodes (492877 simplex iterations) in 87.73 seconds (42.40 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.54341 0.545049 0.548883 ... 0.667504

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

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

        Job resource usage summary 

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

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