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.038579 seconds.
    local lower bound updated to 0.313278
    local upper bound updated to 0.575403

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0464279 seconds.
    local lower bound updated to 0.372812
    local upper bound updated to 0.575403

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.588651
    local lower bound updated to 0.575403

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.165839 seconds.
    local lower bound updated to 0.413743
    local upper bound updated to 0.575403

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0982203 seconds.
    local lower bound updated to 0.575403
    local upper bound updated to 0.575403
The time obtain the optimal randomized assortment is 0.481076 (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_208912.log"
The computation time limit for a lower bound is 85998
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 444 rows, 418 columns and 1359 nonzeros
Model fingerprint: 0x6ed993a2
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [6e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 149 rows and 270 columns
Presolve time: 0.00s
Presolved: 295 rows, 148 columns, 1076 nonzeros
Variable types: 115 continuous, 33 integer (33 binary)
Found heuristic solution: objective 0.7250973
Found heuristic solution: objective 0.7240416
Found heuristic solution: objective 0.6323183

Root relaxation: objective 4.703713e-01, 58 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.47037    0    6    0.63232    0.47037  25.6%     -    0s
H    0     0                       0.6219509    0.47037  24.4%     -    0s
H    0     0                       0.6210267    0.47037  24.3%     -    0s
H    0     0                       0.6016776    0.47037  21.8%     -    0s
H    0     0                       0.5942491    0.47192  20.6%     -    0s
     0     0    0.47192    0   12    0.59425    0.47192  20.6%     -    0s
     0     0    0.48758    0   14    0.59425    0.48758  18.0%     -    0s
     0     0    0.49406    0   13    0.59425    0.49406  16.9%     -    0s
H    0     0                       0.5826759    0.52649  9.64%     -    0s
     0     0    0.52649    0   13    0.58268    0.52649  9.64%     -    0s
     0     0    0.52659    0   12    0.58268    0.52659  9.62%     -    0s
H    0     0                       0.5754026    0.52659  8.48%     -    0s
     0     0    0.54064    0   12    0.57540    0.54064  6.04%     -    0s
     0     0    0.54360    0   15    0.57540    0.54360  5.53%     -    0s
     0     0    0.54748    0   10    0.57540    0.54748  4.85%     -    0s
     0     2    0.54748    0   10    0.57540    0.54748  4.85%     -    0s

Cutting planes:
  Implied bound: 25
  MIR: 4
  Flow cover: 18
  RLT: 5
  Relax-and-lift: 7

Explored 21 nodes (536 simplex iterations) in 0.10 seconds (0.03 work units)
Thread count was 4 (of 48 available processors)

Solution count 9: 0.575403 0.582676 0.594249 ... 0.725097

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

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

        Job resource usage summary 

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

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