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.111648 seconds.
    local lower bound updated to 0.310261
    local upper bound updated to 0.480718

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.528226
    local lower bound updated to 0.513006

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.052752 seconds.
    local lower bound updated to 0.371377
    local upper bound updated to 0.493113

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.0302398 seconds.
    local lower bound updated to 0.443113
    local upper bound updated to 0.486101

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.0502121 seconds.
    local lower bound updated to 0.478447
    local upper bound updated to 0.482196

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.0698914 seconds.
    local lower bound updated to 0.481469
    local upper bound updated to 0.481564

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.0765086 seconds.
    local lower bound updated to 0.481564
    local upper bound updated to 0.481564
The Primal step takes 0.287497 (S)
lower bound updated to 0.481564

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.508602
    local lower bound updated to 0.492053

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.504594
    local lower bound updated to 0.493068

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.500793
    local lower bound updated to 0.498927

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.500793
    local lower bound updated to 0.499147

    ++ RESTRICTED DUAL ITERATION 5 ++
    local upper bound updated to 0.499147
    local lower bound updated to 0.499147
The Dual step takes 0.191241 (S)
upper bound updated to 0.499147
*** OUTER ITERATION 2 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.331939 seconds.
    local lower bound updated to 0.403604
    local upper bound updated to 0.488871

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.200872 seconds.
    local lower bound updated to 0.478804
    local upper bound updated to 0.485924

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.102325 seconds.
    local lower bound updated to 0.478804
    local upper bound updated to 0.485031

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.252396 seconds.
    local lower bound updated to 0.479154
    local upper bound updated to 0.482917

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.198969 seconds.
    local lower bound updated to 0.479154
    local upper bound updated to 0.482735

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 0.240644 seconds.
    local lower bound updated to 0.481795
    local upper bound updated to 0.482589

    ++ RESTRICTED PRIMAL ITERATION 7 ++
One worst-case parameter optimization takes 0.12693 seconds.
    local lower bound updated to 0.481951
    local upper bound updated to 0.482494

    ++ RESTRICTED PRIMAL ITERATION 8 ++
One worst-case parameter optimization takes 0.266146 seconds.
    local lower bound updated to 0.482494
    local upper bound updated to 0.482494
The Primal step takes 1.73855 (S)
lower bound updated to 0.482494

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.493595
    local lower bound updated to 0.482494

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.330217 seconds.
    local lower bound updated to 0.403604
    local upper bound updated to 0.482494

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.274664 seconds.
    local lower bound updated to 0.482494
    local upper bound updated to 0.482494
The time obtain the optimal randomized assortment is 3.17982 (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_108412.log"
The computation time limit for a lower bound is 85995
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 720 rows, 700 columns and 2169 nonzeros
Model fingerprint: 0xb4c6288a
Variable types: 659 continuous, 41 integer (41 binary)
Coefficient statistics:
  Matrix range     [7e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 271 rows and 486 columns
Presolve time: 0.01s
Presolved: 449 rows, 214 columns, 1594 nonzeros
Variable types: 178 continuous, 36 integer (36 binary)
Found heuristic solution: objective 0.5131706

Root relaxation: objective 4.043330e-01, 84 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.40433    0   11    0.51317    0.40433  21.2%     -    0s
H    0     0                       0.4830187    0.40433  16.3%     -    0s
H    0     0                       0.4826982    0.40433  16.2%     -    0s
     0     0    0.44294    0   15    0.48270    0.44294  8.24%     -    0s
H    0     0                       0.4825927    0.44294  8.22%     -    0s
     0     0    0.45003    0   15    0.48259    0.45003  6.75%     -    0s
     0     0    0.45421    0   17    0.48259    0.45421  5.88%     -    0s
     0     0    0.45722    0   17    0.48259    0.45722  5.26%     -    0s
     0     0    0.45867    0   15    0.48259    0.45867  4.96%     -    0s
     0     0    0.45930    0   14    0.48259    0.45930  4.83%     -    0s
H    0     0                       0.4825919    0.45930  4.83%     -    0s
     0     0    0.46161    0   16    0.48259    0.46161  4.35%     -    0s
H    0     0                       0.4824942    0.46184  4.28%     -    0s
     0     0    0.46222    0   16    0.48249    0.46222  4.20%     -    0s
     0     0    0.46235    0   16    0.48249    0.46235  4.18%     -    0s
     0     2    0.46235    0   16    0.48249    0.46235  4.18%     -    0s

Cutting planes:
  Gomory: 1
  Implied bound: 46
  MIR: 22
  Flow cover: 30
  RLT: 2
  Relax-and-lift: 24

Explored 93 nodes (1248 simplex iterations) in 0.26 seconds (0.10 work units)
Thread count was 4 (of 48 available processors)

Solution count 6: 0.482494 0.482592 0.482593 ... 0.513171

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

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

        Job resource usage summary 

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

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