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.036548 seconds.
    local lower bound updated to 0.311674
    local upper bound updated to 0.600686

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.035681 seconds.
    local lower bound updated to 0.311674
    local upper bound updated to 0.600686

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0359337 seconds.
    local lower bound updated to 0.600686
    local upper bound updated to 0.600686
The time obtain the optimal randomized assortment is 0.157116 (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_202612.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 260 rows, 230 columns and 803 nonzeros
Model fingerprint: 0xbd7cf7fc
Variable types: 189 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [2e-05, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 89 rows and 129 columns
Presolve time: 0.00s
Presolved: 171 rows, 101 columns, 640 nonzeros
Variable types: 67 continuous, 34 integer (34 binary)
Found heuristic solution: objective 0.7859435
Found heuristic solution: objective 0.7511852

Root relaxation: objective 4.955177e-01, 17 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.49552    0    7    0.75119    0.49552  34.0%     -    0s
H    0     0                       0.6696612    0.49552  26.0%     -    0s
     0     0    0.53376    0   13    0.66966    0.53376  20.3%     -    0s
H    0     0                       0.6164718    0.53376  13.4%     -    0s
H    0     0                       0.6066760    0.53376  12.0%     -    0s
     0     0    0.58030    0   11    0.60668    0.58030  4.35%     -    0s
H    0     0                       0.6006861    0.58030  3.39%     -    0s
     0     0    0.58081    0   13    0.60069    0.58081  3.31%     -    0s

Cutting planes:
  Gomory: 5
  Implied bound: 15
  MIR: 6
  Flow cover: 2
  RLT: 5
  Relax-and-lift: 8

Explored 1 nodes (94 simplex iterations) in 0.04 seconds (0.01 work units)
Thread count was 4 (of 48 available processors)

Solution count 6: 0.600686 0.606676 0.616472 ... 0.785943

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

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

        Job resource usage summary 

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

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