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.0441169 seconds.
    local lower bound updated to 0.244998
    local upper bound updated to 0.416664

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

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.132509 seconds.
    local lower bound updated to 0.246694
    local upper bound updated to 0.4184

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0541704 seconds.
    local lower bound updated to 0.411829
    local upper bound updated to 0.416664

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.419902
    local lower bound updated to 0.416664

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.17765 seconds.
    local lower bound updated to 0.290102
    local upper bound updated to 0.416664

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0656931 seconds.
    local lower bound updated to 0.416664
    local upper bound updated to 0.416664
The time obtain the optimal randomized assortment is 0.631471 (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_62512.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 460 rows, 418 columns and 1403 nonzeros
Model fingerprint: 0x8111f8d2
Variable types: 377 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [9e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [5e-01, 1e+00]
Presolve removed 149 rows and 264 columns
Presolve time: 0.00s
Presolved: 311 rows, 154 columns, 1142 nonzeros
Variable types: 120 continuous, 34 integer (34 binary)
Found heuristic solution: objective 0.6193383
Found heuristic solution: objective 0.6139214
Found heuristic solution: objective 0.5123944

Root relaxation: objective 2.714347e-01, 58 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.27143    0    4    0.51239    0.27143  47.0%     -    0s
H    0     0                       0.4849454    0.27143  44.0%     -    0s
     0     0    0.28432    0   11    0.48495    0.28432  41.4%     -    0s
H    0     0                       0.4170715    0.28432  31.8%     -    0s
     0     0    0.32727    0   13    0.41707    0.32727  21.5%     -    0s
     0     0    0.33178    0   12    0.41707    0.33178  20.4%     -    0s
     0     0    0.35557    0   12    0.41707    0.35557  14.7%     -    0s
     0     0    0.36197    0   12    0.41707    0.36197  13.2%     -    0s
H    0     0                       0.4166637    0.38569  7.43%     -    0s
     0     0    0.39956    0   10    0.41666    0.39956  4.11%     -    0s
     0     0    0.41666    0   10    0.41666    0.41666  0.00%     -    0s

Cutting planes:
  Implied bound: 33
  MIR: 5
  Flow cover: 10
  RLT: 2
  Relax-and-lift: 30

Explored 1 nodes (371 simplex iterations) in 0.07 seconds (0.02 work units)
Thread count was 4 (of 48 available processors)

Solution count 6: 0.416664 0.417071 0.484945 ... 0.619338

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

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

        Job resource usage summary 

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

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