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.236882 seconds.
    local lower bound updated to 0.398353
    local upper bound updated to 0.597419

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.616922
    local lower bound updated to 0.609129

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.224459 seconds.
    local lower bound updated to 0.433025
    local upper bound updated to 0.592089

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.68202 seconds.
    local lower bound updated to 0.590259
    local upper bound updated to 0.591883

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.496992 seconds.
    local lower bound updated to 0.591531
    local upper bound updated to 0.591569

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.621091
    local lower bound updated to 0.594485

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.595698
    local lower bound updated to 0.595201

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.01849 seconds.
    local lower bound updated to 0.499431
    local upper bound updated to 0.594489

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.491934 seconds.
    local lower bound updated to 0.576707
    local upper bound updated to 0.594344

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.869018 seconds.
    local lower bound updated to 0.583825
    local upper bound updated to 0.593163

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.977281 seconds.
    local lower bound updated to 0.59114
    local upper bound updated to 0.592553

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 1.22707 seconds.
    local lower bound updated to 0.59114
    local upper bound updated to 0.592493

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 1.1458 seconds.
    local lower bound updated to 0.59114
    local upper bound updated to 0.592306

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 1.29712 seconds.
    local lower bound updated to 0.591638
    local upper bound updated to 0.592059

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 1.33867 seconds.
    local lower bound updated to 0.591638
    local upper bound updated to 0.592028

    ++ RESTRICTED PRIMAL ITERATION 9 ++
One worst-case parameter optimization takes 1.1479 seconds.
    local lower bound updated to 0.592028
    local upper bound updated to 0.592028
The Primal step takes 9.53556 (S)
lower bound updated to 0.592028

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.620211
    local lower bound updated to 0.592028

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.05789 seconds.
    local lower bound updated to 0.499431
    local upper bound updated to 0.592028

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 1.18774 seconds.
    local lower bound updated to 0.592028
    local upper bound updated to 0.592028
The time obtain the optimal randomized assortment is 14.7574 (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_64414.log"
The computation time limit for a lower bound is 85984
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 708 rows, 610 columns and 2227 nonzeros
Model fingerprint: 0x4c321779
Variable types: 561 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [6e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 220 rows and 373 columns
Presolve time: 0.01s
Presolved: 488 rows, 237 columns, 1828 nonzeros
Variable types: 195 continuous, 42 integer (42 binary)
Found heuristic solution: objective 0.7675838
Found heuristic solution: objective 0.6672483

Root relaxation: objective 3.596794e-01, 70 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.35968    0   14    0.66725    0.35968  46.1%     -    0s
H    0     0                       0.6393934    0.35968  43.7%     -    0s
     0     0    0.37460    0   20    0.63939    0.37460  41.4%     -    0s
H    0     0                       0.6300098    0.37460  40.5%     -    0s
H    0     0                       0.6288018    0.43760  30.4%     -    0s
     0     0    0.43760    0   20    0.62880    0.43760  30.4%     -    0s
H    0     0                       0.6078026    0.43760  28.0%     -    0s
     0     0    0.43762    0   23    0.60780    0.43762  28.0%     -    0s
H    0     0                       0.6058136    0.43762  27.8%     -    0s
     0     0    0.45330    0   22    0.60581    0.45330  25.2%     -    0s
     0     0    0.45696    0   20    0.60581    0.45696  24.6%     -    0s
     0     0    0.48203    0   20    0.60581    0.48203  20.4%     -    0s
     0     0    0.48244    0   20    0.60581    0.48244  20.4%     -    0s
     0     0    0.48559    0   19    0.60581    0.48559  19.8%     -    0s
H    0     0                       0.6004163    0.48559  19.1%     -    0s
H    0     0                       0.5975789    0.48559  18.7%     -    0s
H    0     0                       0.5920279    0.48559  18.0%     -    0s
     0     2    0.48559    0   19    0.59203    0.48559  18.0%     -    0s
H 1044    62                       0.5920279    0.56736  4.17%   8.9    1s

Cutting planes:
  Implied bound: 57
  MIR: 20
  Flow cover: 62
  RLT: 17
  Relax-and-lift: 40

Explored 1210 nodes (11147 simplex iterations) in 1.36 seconds (0.70 work units)
Thread count was 4 (of 48 available processors)

Solution count 10: 0.592028 0.592028 0.597579 ... 0.667248

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

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

        Job resource usage summary 

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

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