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.169288 seconds.
    local lower bound updated to 0.33391
    local upper bound updated to 0.655998

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.705321
    local lower bound updated to 0.698329

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.333194 seconds.
    local lower bound updated to 0.398098
    local upper bound updated to 0.661157

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.219954 seconds.
    local lower bound updated to 0.637597
    local upper bound updated to 0.654756

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.663511
    local lower bound updated to 0.656573

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.663511
    local lower bound updated to 0.658343

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.663511
    local lower bound updated to 0.658504

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.658504
    local lower bound updated to 0.658504
The Dual step takes 0.249293 (S)
upper bound updated to 0.658504
*** OUTER ITERATION 2 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.577318 seconds.
    local lower bound updated to 0.515221
    local upper bound updated to 0.658275

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.434269 seconds.
    local lower bound updated to 0.65221
    local upper bound updated to 0.657263

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.583211 seconds.
    local lower bound updated to 0.655807
    local upper bound updated to 0.656778

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.565335 seconds.
    local lower bound updated to 0.656046
    local upper bound updated to 0.656721

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.547153 seconds.
    local lower bound updated to 0.656046
    local upper bound updated to 0.656297

    ++ RESTRICTED PRIMAL ITERATION 6 ++
One worst-case parameter optimization takes 0.551994 seconds.
    local lower bound updated to 0.656297
    local upper bound updated to 0.656297
The Primal step takes 3.27668 (S)
lower bound updated to 0.656297

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.661405
    local lower bound updated to 0.656297

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.658023
    local lower bound updated to 0.656297

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 1.02614 seconds.
    local lower bound updated to 0.513637
    local upper bound updated to 0.656297

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.848701 seconds.
    local lower bound updated to 0.656297
    local upper bound updated to 0.656297
The time obtain the optimal randomized assortment is 7.11958 (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_15_4_200.000000_206216.log"
The computation time limit for a lower bound is 85991
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 1200 rows, 968 columns and 3848 nonzeros
Model fingerprint: 0x57d41c46
Variable types: 911 continuous, 57 integer (57 binary)
Coefficient statistics:
  Matrix range     [3e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [3e-01, 1e+00]
Presolve removed 307 rows and 549 columns
Presolve time: 0.01s
Presolved: 893 rows, 419 columns, 3399 nonzeros
Variable types: 365 continuous, 54 integer (54 binary)
Found heuristic solution: objective 0.7786364
Found heuristic solution: objective 0.7488735

Root relaxation: objective 6.131705e-01, 136 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.61317    0   20    0.74887    0.61317  18.1%     -    0s
H    0     0                       0.7299307    0.61651  15.5%     -    0s
     0     0    0.61661    0   24    0.72993    0.61661  15.5%     -    0s
H    0     0                       0.7294965    0.61661  15.5%     -    0s
     0     0    0.63072    0   24    0.72950    0.63072  13.5%     -    0s
H    0     0                       0.6777433    0.63072  6.94%     -    0s
     0     0    0.63106    0   23    0.67774    0.63106  6.89%     -    0s
     0     0    0.64146    0   23    0.67774    0.64146  5.35%     -    0s
H    0     0                       0.6619362    0.64146  3.09%     -    0s
     0     0    0.64198    0   24    0.66194    0.64198  3.01%     -    0s
H    0     0                       0.6562971    0.64198  2.18%     -    0s
     0     0    0.64431    0   23    0.65630    0.64431  1.83%     -    0s
     0     0    0.64465    0   22    0.65630    0.64465  1.78%     -    0s
     0     0    0.64490    0   20    0.65630    0.64490  1.74%     -    0s
     0     2    0.64490    0   20    0.65630    0.64490  1.74%     -    0s

Cutting planes:
  Implied bound: 118
  MIR: 17
  Flow cover: 70
  RLT: 13
  Relax-and-lift: 48

Explored 83 nodes (2159 simplex iterations) in 0.66 seconds (0.29 work units)
Thread count was 4 (of 48 available processors)

Solution count 7: 0.656297 0.661936 0.677743 ... 0.778636

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

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

        Job resource usage summary 

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

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