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.0987475 seconds.
    local lower bound updated to 0.247352
    local upper bound updated to 0.478324

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.509094
    local lower bound updated to 0.502131

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.211192 seconds.
    local lower bound updated to 0.322063
    local upper bound updated to 0.474508

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.172865 seconds.
    local lower bound updated to 0.423888
    local upper bound updated to 0.439636

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.463064
    local lower bound updated to 0.439636

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.200243 seconds.
    local lower bound updated to 0.322063
    local upper bound updated to 0.439636

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.101843 seconds.
    local lower bound updated to 0.439636
    local upper bound updated to 0.439636
The time obtain the optimal randomized assortment is 1.05072 (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_100.000000_108212.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: 24 physical cores, 48 logical processors, using up to 4 threads
Optimize a model with 368 rows, 324 columns and 1122 nonzeros
Model fingerprint: 0x46f4eb2d
Variable types: 283 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 127 rows and 198 columns
Presolve time: 0.00s
Presolved: 241 rows, 126 columns, 886 nonzeros
Variable types: 93 continuous, 33 integer (33 binary)
Found heuristic solution: objective 0.6205826
Found heuristic solution: objective 0.4502937

Root relaxation: objective 1.936273e-01, 36 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.19363    0    5    0.45029    0.19363  57.0%     -    0s
H    0     0                       0.4421732    0.19363  56.2%     -    0s
     0     0    0.21328    0   12    0.44217    0.21328  51.8%     -    0s
     0     0    0.27675    0   15    0.44217    0.27675  37.4%     -    0s
     0     0    0.28052    0   15    0.44217    0.28052  36.6%     -    0s
     0     0    0.31048    0   15    0.44217    0.31048  29.8%     -    0s
     0     0    0.31310    0   15    0.44217    0.31310  29.2%     -    0s
     0     0    0.34477    0   15    0.44217    0.34477  22.0%     -    0s
H    0     0                       0.4396362    0.34874  20.7%     -    0s
     0     0    0.34874    0   16    0.43964    0.34874  20.7%     -    0s
     0     0    0.35071    0   10    0.43964    0.35071  20.2%     -    0s
     0     2    0.35071    0   10    0.43964    0.35071  20.2%     -    0s

Cutting planes:
  Implied bound: 22
  MIR: 5
  Flow cover: 17
  RLT: 4
  Relax-and-lift: 12

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

Solution count 4: 0.439636 0.442173 0.450294 0.620583 

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

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

        Job resource usage summary 

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

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