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.131325 seconds.
    local lower bound updated to 0.23379
    local upper bound updated to 0.453494

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.586004
    local lower bound updated to 0.574935

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.328615 seconds.
    local lower bound updated to 0.305922
    local upper bound updated to 0.457621

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.187854 seconds.
    local lower bound updated to 0.453496
    local upper bound updated to 0.453506
The Primal step takes 0.520619 (S)
lower bound updated to 0.453496

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.51218
    local lower bound updated to 0.453506

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.469147
    local lower bound updated to 0.466848

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.271621 seconds.
    local lower bound updated to 0.332642
    local upper bound updated to 0.454717

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.279501 seconds.
    local lower bound updated to 0.453342
    local upper bound updated to 0.453506

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.48597
    local lower bound updated to 0.453506

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.454597
    local lower bound updated to 0.454287

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.454597
    local lower bound updated to 0.45447

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.05021 seconds.
    local lower bound updated to 0.387864
    local upper bound updated to 0.454383

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.459094 seconds.
    local lower bound updated to 0.420292
    local upper bound updated to 0.454061

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.717744 seconds.
    local lower bound updated to 0.444117
    local upper bound updated to 0.453923

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.634204 seconds.
    local lower bound updated to 0.453328
    local upper bound updated to 0.453506

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.480422
    local lower bound updated to 0.453506

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.26706 seconds.
    local lower bound updated to 0.387864
    local upper bound updated to 0.453506

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.37764 seconds.
    local lower bound updated to 0.453506
    local upper bound updated to 0.453506
The time obtain the optimal randomized assortment is 7.38631 (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_100.000000_106114.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: 20 physical cores, 40 logical processors, using up to 4 threads
Optimize a model with 960 rows, 834 columns and 2995 nonzeros
Model fingerprint: 0xb54f5b9a
Variable types: 785 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        [1e-01, 1e+00]
Presolve removed 309 rows and 531 columns
Presolve time: 0.01s
Presolved: 651 rows, 303 columns, 2448 nonzeros
Variable types: 256 continuous, 47 integer (47 binary)
Found heuristic solution: objective 0.6481337
Found heuristic solution: objective 0.5644062

Root relaxation: objective 3.288713e-01, 108 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.32887    0   13    0.56441    0.32887  41.7%     -    0s
H    0     0                       0.5542915    0.34330  38.1%     -    0s
     0     0    0.35378    0   18    0.55429    0.35378  36.2%     -    0s
H    0     0                       0.5513360    0.38892  29.5%     -    0s
     0     0    0.38892    0   15    0.55134    0.38892  29.5%     -    0s
H    0     0                       0.4844735    0.38892  19.7%     -    0s
H    0     0                       0.4818967    0.38936  19.2%     -    0s
     0     0    0.39175    0   15    0.48190    0.39175  18.7%     -    0s
H    0     0                       0.4737238    0.39175  17.3%     -    0s
     0     0    0.40961    0   16    0.47372    0.40961  13.5%     -    0s
     0     0    0.43050    0   16    0.47372    0.43050  9.12%     -    0s
H    0     0                       0.4658587    0.43050  7.59%     -    0s
     0     0    0.43714    0   16    0.46586    0.43714  6.16%     -    0s
H    0     0                       0.4535059    0.43714  3.61%     -    0s
     0     0    0.43931    0   16    0.45351    0.43931  3.13%     -    0s
     0     0    0.43997    0   17    0.45351    0.43997  2.98%     -    0s
     0     2    0.43997    0   17    0.45351    0.43997  2.98%     -    0s

Cutting planes:
  Implied bound: 82
  MIR: 19
  Flow cover: 44
  RLT: 6
  Relax-and-lift: 36

Explored 32 nodes (1153 simplex iterations) in 0.38 seconds (0.12 work units)
Thread count was 4 (of 40 available processors)

Solution count 9: 0.453506 0.465859 0.473724 ... 0.648134

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

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

        Job resource usage summary 

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

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