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.0689809 seconds.
    local lower bound updated to 0.395237
    local upper bound updated to 0.704767

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.70981
    local lower bound updated to 0.703261

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.193552 seconds.
    local lower bound updated to 0.494869
    local upper bound updated to 0.702693

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.144478 seconds.
    local lower bound updated to 0.697763
    local upper bound updated to 0.698

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.7017
    local lower bound updated to 0.698

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.7017
    local lower bound updated to 0.698889

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.213925 seconds.
    local lower bound updated to 0.538711
    local upper bound updated to 0.698889

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.22339 seconds.
    local lower bound updated to 0.698066
    local upper bound updated to 0.698483

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.702801
    local lower bound updated to 0.698602

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.294654 seconds.
    local lower bound updated to 0.58201
    local upper bound updated to 0.698602

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.380114 seconds.
    local lower bound updated to 0.69787
    local upper bound updated to 0.698602

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.703023
    local lower bound updated to 0.698602

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.269112 seconds.
    local lower bound updated to 0.58201
    local upper bound updated to 0.698602

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.289403 seconds.
    local lower bound updated to 0.698602
    local upper bound updated to 0.698602
The time obtain the optimal randomized assortment is 3.14506 (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_60.000000_61412.log"
The computation time limit for a lower bound is 85995
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 628 rows, 606 columns and 1882 nonzeros
Model fingerprint: 0xa1995365
Variable types: 565 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [4e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 244 rows and 423 columns
Presolve time: 0.01s
Presolved: 384 rows, 183 columns, 1384 nonzeros
Variable types: 149 continuous, 34 integer (34 binary)
Found heuristic solution: objective 0.8352268
Found heuristic solution: objective 0.7853071
Found heuristic solution: objective 0.7792991

Root relaxation: objective 5.695364e-01, 60 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.56954    0   13    0.77930    0.56954  26.9%     -    0s
H    0     0                       0.7316679    0.56954  22.2%     -    0s
H    0     0                       0.7214713    0.63126  12.5%     -    0s
     0     0    0.63126    0   13    0.72147    0.63126  12.5%     -    0s
H    0     0                       0.7013372    0.63126  10.0%     -    0s
     0     0    0.63126    0   13    0.70134    0.63126  10.0%     -    0s
     0     0    0.64959    0   13    0.70134    0.64959  7.38%     -    0s
H    0     0                       0.7012384    0.64959  7.37%     -    0s
     0     0    0.64976    0   13    0.70124    0.64976  7.34%     -    0s
     0     0    0.65806    0   13    0.70124    0.65806  6.16%     -    0s
H    0     0                       0.6997031    0.65834  5.91%     -    0s
     0     0    0.65834    0   14    0.69970    0.65834  5.91%     -    0s
     0     0    0.66207    0   14    0.69970    0.66207  5.38%     -    0s
H    0     0                       0.6986021    0.66207  5.23%     -    0s
     0     0    0.66387    0   16    0.69860    0.66387  4.97%     -    0s
     0     0    0.66441    0   13    0.69860    0.66441  4.89%     -    0s
     0     2    0.66441    0   13    0.69860    0.66441  4.89%     -    0s

Cutting planes:
  Implied bound: 38
  MIR: 10
  Flow cover: 48
  RLT: 7
  Relax-and-lift: 10

Explored 76 nodes (1229 simplex iterations) in 0.30 seconds (0.08 work units)
Thread count was 4 (of 48 available processors)

Solution count 9: 0.698602 0.699703 0.701238 ... 0.835227

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

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

        Job resource usage summary 

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

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