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.0962543 seconds.
    local lower bound updated to 0.262119
    local upper bound updated to 0.514416

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.202614 seconds.
    local lower bound updated to 0.333886
    local upper bound updated to 0.514416

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.231526 seconds.
    local lower bound updated to 0.380433
    local upper bound updated to 0.520073

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0451182 seconds.
    local lower bound updated to 0.495338
    local upper bound updated to 0.518409

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.531379
    local lower bound updated to 0.518409

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.228164 seconds.
    local lower bound updated to 0.380433
    local upper bound updated to 0.518409

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.188058 seconds.
    local lower bound updated to 0.518409
    local upper bound updated to 0.518409
The time obtain the optimal randomized assortment is 1.49359 (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_202912.log"
The computation time limit for a lower bound is 85997
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 444 rows, 418 columns and 1352 nonzeros
Model fingerprint: 0xb83facc1
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-05, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 151 rows and 267 columns
Presolve time: 0.00s
Presolved: 293 rows, 151 columns, 1065 nonzeros
Variable types: 115 continuous, 36 integer (36 binary)
Found heuristic solution: objective 0.5456041
Found heuristic solution: objective 0.5443224

Root relaxation: objective 4.416991e-01, 33 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.44170    0   10    0.54432    0.44170  18.9%     -    0s
H    0     0                       0.5213938    0.44170  15.3%     -    0s
     0     0    0.47545    0   16    0.52139    0.47545  8.81%     -    0s
H    0     0                       0.5184093    0.47545  8.29%     -    0s
     0     0    0.48511    0   15    0.51841    0.48511  6.42%     -    0s
     0     0    0.49258    0   17    0.51841    0.49258  4.98%     -    0s
     0     0    0.49603    0   18    0.51841    0.49603  4.32%     -    0s
     0     0    0.49850    0   16    0.51841    0.49850  3.84%     -    0s
     0     0    0.50179    0   16    0.51841    0.50179  3.21%     -    0s
     0     0    0.51250    0   16    0.51841    0.51250  1.14%     -    0s
     0     0    0.51511    0   13    0.51841    0.51511  0.64%     -    0s
     0     2    0.51511    0   13    0.51841    0.51511  0.64%     -    0s

Cutting planes:
  Implied bound: 30
  MIR: 7
  Flow cover: 11
  RLT: 2
  Relax-and-lift: 18

Explored 37 nodes (628 simplex iterations) in 0.18 seconds (0.06 work units)
Thread count was 4 (of 40 available processors)

Solution count 4: 0.518409 0.521394 0.544322 0.545604 

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

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

        Job resource usage summary 

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

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