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.0292585 seconds.
    local lower bound updated to 0.333384
    local upper bound updated to 0.582032

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.580734
    local lower bound updated to 0.579436

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0290682 seconds.
    local lower bound updated to 0.333384
    local upper bound updated to 0.579436

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0385952 seconds.
    local lower bound updated to 0.579436
    local upper bound updated to 0.579436
The time obtain the optimal randomized assortment is 0.158396 (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_104112.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 813 nonzeros
Model fingerprint: 0x021bc302
Variable types: 189 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        [5e-01, 1e+00]
Presolve removed 79 rows and 126 columns
Presolve time: 0.00s
Presolved: 181 rows, 104 columns, 671 nonzeros
Variable types: 72 continuous, 32 integer (32 binary)
Found heuristic solution: objective 0.7328283
Found heuristic solution: objective 0.7163663

Root relaxation: objective 5.235201e-01, 25 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.52352    0    6    0.71637    0.52352  26.9%     -    0s
H    0     0                       0.5820322    0.52352  10.1%     -    0s
     0     0    0.56914    0    5    0.58203    0.56914  2.22%     -    0s
H    0     0                       0.5805557    0.56914  1.97%     -    0s
     0     0    0.57916    0    5    0.58056    0.57916  0.24%     -    0s
     0     0    0.57943    0    5    0.58056    0.57943  0.19%     -    0s
H    0     0                       0.5794355    0.57943  0.00%     -    0s
     0     0    0.57943    0    5    0.57944    0.57943  0.00%     -    0s

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

Solution count 6: 0.579436 0.580556 0.582032 ... 0.732828

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

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

        Job resource usage summary 

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

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