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.175869 seconds.
    local lower bound updated to 0.33261
    local upper bound updated to 0.662458

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.666688
    local lower bound updated to 0.660262

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.185178 seconds.
    local lower bound updated to 0.438929
    local upper bound updated to 0.659211

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.199368 seconds.
    local lower bound updated to 0.658524
    local upper bound updated to 0.659076

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.659994
    local lower bound updated to 0.659076

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.189204 seconds.
    local lower bound updated to 0.438929
    local upper bound updated to 0.659076

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.117298 seconds.
    local lower bound updated to 0.659076
    local upper bound updated to 0.659076
The time obtain the optimal randomized assortment is 1.17337 (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_200.000000_202112.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 352 rows, 324 columns and 1083 nonzeros
Model fingerprint: 0xc471ab5f
Variable types: 283 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [6e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 120 rows and 196 columns
Presolve time: 0.00s
Presolved: 232 rows, 128 columns, 863 nonzeros
Variable types: 92 continuous, 36 integer (36 binary)
Found heuristic solution: objective 0.6799375
Found heuristic solution: objective 0.6633655

Root relaxation: objective 6.251931e-01, 32 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.62519    0    8    0.66337    0.62519  5.75%     -    0s
     0     0    0.62975    0   10    0.66337    0.62975  5.07%     -    0s
H    0     0                       0.6616699    0.62975  4.82%     -    0s
H    0     0                       0.6590763    0.63378  3.84%     -    0s
     0     0    0.63378    0    7    0.65908    0.63378  3.84%     -    0s
     0     0    0.63541    0    7    0.65908    0.63541  3.59%     -    0s
     0     0    0.64130    0   13    0.65908    0.64130  2.70%     -    0s
     0     0    0.64130    0   13    0.65908    0.64130  2.70%     -    0s
     0     0    0.64494    0   14    0.65908    0.64494  2.14%     -    0s
     0     0    0.64616    0   13    0.65908    0.64616  1.96%     -    0s
     0     0    0.64625    0   10    0.65908    0.64625  1.95%     -    0s
     0     2    0.64625    0   10    0.65908    0.64625  1.95%     -    0s

Cutting planes:
  Gomory: 1
  Implied bound: 21
  MIR: 6
  Flow cover: 11
  RLT: 2
  Relax-and-lift: 15

Explored 69 nodes (757 simplex iterations) in 0.12 seconds (0.04 work units)
Thread count was 4 (of 40 available processors)

Solution count 4: 0.659076 0.66167 0.663366 0.679937 

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

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

        Job resource usage summary 

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

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