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.158773 seconds.
    local lower bound updated to 0.350527
    local upper bound updated to 0.645863

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.694489
    local lower bound updated to 0.645657

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.688399
    local lower bound updated to 0.683858

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.688399
    local lower bound updated to 0.687584

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.687584
    local lower bound updated to 0.687584
The Dual step takes 0.0421629 (S)
upper bound updated to 0.687584
*** OUTER ITERATION 1 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.499471 seconds.
    local lower bound updated to 0.494614
    local upper bound updated to 0.664994

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.225981 seconds.
    local lower bound updated to 0.603232
    local upper bound updated to 0.65344

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.325716 seconds.
    local lower bound updated to 0.603232
    local upper bound updated to 0.640304

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.2641 seconds.
    local lower bound updated to 0.638697
    local upper bound updated to 0.638878

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.663416
    local lower bound updated to 0.653965

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.660739
    local lower bound updated to 0.655913

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.09671 seconds.
    local lower bound updated to 0.538046
    local upper bound updated to 0.647687

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.611817 seconds.
    local lower bound updated to 0.640328
    local upper bound updated to 0.646125

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.553148 seconds.
    local lower bound updated to 0.645461
    local upper bound updated to 0.64586

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.65569
    local lower bound updated to 0.64586

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.876965 seconds.
    local lower bound updated to 0.538046
    local upper bound updated to 0.64586

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.517233 seconds.
    local lower bound updated to 0.64586
    local upper bound updated to 0.64586
The time obtain the optimal randomized assortment is 6.5439 (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_206014.log"
The computation time limit for a lower bound is 85992
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 960 rows, 834 columns and 2993 nonzeros
Model fingerprint: 0xef90a243
Variable types: 785 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [1e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [7e-01, 1e+00]
Presolve removed 309 rows and 529 columns
Presolve time: 0.01s
Presolved: 651 rows, 305 columns, 2464 nonzeros
Variable types: 259 continuous, 46 integer (46 binary)
Found heuristic solution: objective 0.6593247

Root relaxation: objective 5.594695e-01, 82 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.55947    0   16    0.65932    0.55947  15.1%     -    0s
     0     0    0.56857    0   22    0.65932    0.56857  13.8%     -    0s
     0     0    0.56857    0   22    0.65932    0.56857  13.8%     -    0s
     0     0    0.60120    0   24    0.65932    0.60120  8.82%     -    0s
     0     0    0.60295    0   23    0.65932    0.60295  8.55%     -    0s
     0     0    0.61704    0   21    0.65932    0.61704  6.41%     -    0s
     0     0    0.61902    0   20    0.65932    0.61902  6.11%     -    0s
H    0     0                       0.6531230    0.61902  5.22%     -    0s
H    0     0                       0.6513126    0.61902  4.96%     -    0s
H    0     0                       0.6475341    0.61902  4.40%     -    0s
     0     0    0.62169    0   18    0.64753    0.62169  3.99%     -    0s
H    0     0                       0.6474808    0.62334  3.73%     -    0s
     0     0    0.62334    0   20    0.64748    0.62334  3.73%     -    0s
H    0     0                       0.6461769    0.62334  3.53%     -    0s
     0     0    0.62415    0   18    0.64618    0.62415  3.41%     -    0s
H    0     0                       0.6458604    0.62415  3.36%     -    0s
     0     2    0.62415    0   18    0.64586    0.62415  3.36%     -    0s

Cutting planes:
  Implied bound: 76
  MIR: 21
  Flow cover: 81
  RLT: 2
  Relax-and-lift: 30

Explored 208 nodes (3146 simplex iterations) in 0.51 seconds (0.24 work units)
Thread count was 4 (of 48 available processors)

Solution count 7: 0.64586 0.646177 0.647481 ... 0.659325

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

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

        Job resource usage summary 

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

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