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.146351 seconds.
    local lower bound updated to 0.282123
    local upper bound updated to 0.552922

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.55874
    local lower bound updated to 0.545703

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.551225
    local lower bound updated to 0.547118

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.430521 seconds.
    local lower bound updated to 0.364663
    local upper bound updated to 0.547118

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.442471 seconds.
    local lower bound updated to 0.532923
    local upper bound updated to 0.536921

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.461502 seconds.
    local lower bound updated to 0.536454
    local upper bound updated to 0.536776

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.567045
    local lower bound updated to 0.538577

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.548605
    local lower bound updated to 0.541853

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.521129 seconds.
    local lower bound updated to 0.422075
    local upper bound updated to 0.541853

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.361421 seconds.
    local lower bound updated to 0.527526
    local upper bound updated to 0.539508

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.368744 seconds.
    local lower bound updated to 0.530745
    local upper bound updated to 0.537875

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.466002 seconds.
    local lower bound updated to 0.530745
    local upper bound updated to 0.537125

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.549906
    local lower bound updated to 0.537125

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.469046 seconds.
    local lower bound updated to 0.422075
    local upper bound updated to 0.537125

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.383101 seconds.
    local lower bound updated to 0.537125
    local upper bound updated to 0.537125
The time obtain the optimal randomized assortment is 5.78583 (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_65114.log"
The computation time limit for a lower bound is 85993
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 834 rows, 722 columns and 2615 nonzeros
Model fingerprint: 0x85de2939
Variable types: 673 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [3e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 240 rows and 440 columns
Presolve time: 0.01s
Presolved: 594 rows, 282 columns, 2214 nonzeros
Variable types: 236 continuous, 46 integer (46 binary)
Found heuristic solution: objective 0.6370176
Found heuristic solution: objective 0.5985813

Root relaxation: objective 4.485723e-01, 80 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.44857    0   14    0.59858    0.44857  25.1%     -    0s
H    0     0                       0.5966473    0.44857  24.8%     -    0s
H    0     0                       0.5964679    0.44857  24.8%     -    0s
H    0     0                       0.5756933    0.45113  21.6%     -    0s
     0     0    0.45241    0   20    0.57569    0.45241  21.4%     -    0s
H    0     0                       0.5598238    0.45241  19.2%     -    0s
H    0     0                       0.5592997    0.47113  15.8%     -    0s
     0     0    0.47113    0   22    0.55930    0.47113  15.8%     -    0s
H    0     0                       0.5374673    0.47113  12.3%     -    0s
     0     0    0.47956    0   22    0.53747    0.47956  10.8%     -    0s
     0     0    0.49723    0   19    0.53747    0.49723  7.49%     -    0s
     0     0    0.49778    0   19    0.53747    0.49778  7.38%     -    0s
     0     0    0.50541    0   19    0.53747    0.50541  5.96%     -    0s
H    0     0                       0.5371247    0.50541  5.90%     -    0s
     0     0    0.50583    0   19    0.53712    0.50583  5.83%     -    0s
     0     0    0.50645    0   18    0.53712    0.50645  5.71%     -    0s
     0     2    0.50645    0   18    0.53712    0.50645  5.71%     -    0s

Cutting planes:
  Implied bound: 69
  MIR: 14
  Flow cover: 56
  RLT: 6
  Relax-and-lift: 40

Explored 152 nodes (2285 simplex iterations) in 0.47 seconds (0.17 work units)
Thread count was 4 (of 48 available processors)

Solution count 9: 0.537125 0.537467 0.5593 ... 0.637018

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

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

        Job resource usage summary 

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

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