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.0431292 seconds.
    local lower bound updated to 0.256113
    local upper bound updated to 0.499637

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.153396 seconds.
    local lower bound updated to 0.330035
    local upper bound updated to 0.499637

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.533508
    local lower bound updated to 0.499637

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.15995 seconds.
    local lower bound updated to 0.330035
    local upper bound updated to 0.499637

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.143217 seconds.
    local lower bound updated to 0.499637
    local upper bound updated to 0.499637
The time obtain the optimal randomized assortment is 0.766956 (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_67712.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 368 rows, 324 columns and 1133 nonzeros
Model fingerprint: 0xa4f8474a
Variable types: 283 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [5e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 110 rows and 191 columns
Presolve time: 0.00s
Presolved: 258 rows, 133 columns, 948 nonzeros
Variable types: 100 continuous, 33 integer (33 binary)
Found heuristic solution: objective 0.6269312
Found heuristic solution: objective 0.5930031

Root relaxation: objective 3.739102e-01, 30 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.37391    0    6    0.59300    0.37391  36.9%     -    0s
H    0     0                       0.5462257    0.37391  31.5%     -    0s
     0     0    0.37838    0   10    0.54623    0.37838  30.7%     -    0s
H    0     0                       0.5319630    0.37838  28.9%     -    0s
H    0     0                       0.5242631    0.37838  27.8%     -    0s
H    0     0                       0.5195621    0.40549  22.0%     -    0s
     0     0    0.40549    0   14    0.51956    0.40549  22.0%     -    0s
     0     0    0.42946    0   13    0.51956    0.42946  17.3%     -    0s
H    0     0                       0.4996374    0.42946  14.0%     -    0s
     0     0    0.44371    0   15    0.49964    0.44371  11.2%     -    0s
     0     0    0.44379    0   15    0.49964    0.44379  11.2%     -    0s
     0     0    0.45762    0   13    0.49964    0.45762  8.41%     -    0s
     0     0    0.45791    0   12    0.49964    0.45791  8.35%     -    0s
     0     0    0.46141    0   11    0.49964    0.46141  7.65%     -    0s
     0     2    0.46141    0   11    0.49964    0.46141  7.65%     -    0s

Cutting planes:
  Implied bound: 20
  MIR: 2
  Flow cover: 20
  RLT: 1
  Relax-and-lift: 13

Explored 39 nodes (593 simplex iterations) in 0.15 seconds (0.04 work units)
Thread count was 4 (of 48 available processors)

Solution count 7: 0.499637 0.519562 0.524263 ... 0.626931

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

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

        Job resource usage summary 

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

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