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.104467 seconds.
    local lower bound updated to 0.313976
    local upper bound updated to 0.613717

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.12242 seconds.
    local lower bound updated to 0.409936
    local upper bound updated to 0.614007

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.161419 seconds.
    local lower bound updated to 0.61364
    local upper bound updated to 0.613717

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.62525
    local lower bound updated to 0.613717

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.123063 seconds.
    local lower bound updated to 0.409936
    local upper bound updated to 0.613717

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.128629 seconds.
    local lower bound updated to 0.613717
    local upper bound updated to 0.613717
The time obtain the optimal randomized assortment is 1.03704 (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_202614.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 456 rows, 386 columns and 1447 nonzeros
Model fingerprint: 0x2883e1d8
Variable types: 337 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [5e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 125 rows and 209 columns
Presolve time: 0.01s
Presolved: 331 rows, 177 columns, 1246 nonzeros
Variable types: 133 continuous, 44 integer (44 binary)
Found heuristic solution: objective 0.7571129
Found heuristic solution: objective 0.6732509

Root relaxation: objective 5.546856e-01, 43 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.55469    0    8    0.67325    0.55469  17.6%     -    0s
     0     0    0.55537    0   12    0.67325    0.55537  17.5%     -    0s
H    0     0                       0.6675933    0.55537  16.8%     -    0s
H    0     0                       0.6289124    0.55537  11.7%     -    0s
H    0     0                       0.6282261    0.55537  11.6%     -    0s
H    0     0                       0.6259529    0.59293  5.28%     -    0s
H    0     0                       0.6213432    0.59293  4.57%     -    0s
     0     0    0.59293    0   16    0.62134    0.59293  4.57%     -    0s
     0     0    0.59496    0   17    0.62134    0.59496  4.25%     -    0s
H    0     0                       0.6140969    0.59496  3.12%     -    0s
H    0     0                       0.6137173    0.60486  1.44%     -    0s
     0     0    0.60695    0   14    0.61372    0.60695  1.10%     -    0s
     0     0    0.60725    0   14    0.61372    0.60725  1.05%     -    0s
     0     0    0.60869    0    8    0.61372    0.60869  0.82%     -    0s
     0     0    0.61035    0   10    0.61372    0.61035  0.55%     -    0s
     0     0    0.61178    0    9    0.61372    0.61178  0.32%     -    0s

Explored 1 nodes (388 simplex iterations) in 0.13 seconds (0.03 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.613717 0.613717 0.614097 ... 0.757113

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

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

        Job resource usage summary 

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

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