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 2.4277 seconds.
    local lower bound updated to 0.244644
    local upper bound updated to 0.476005

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.498678
    local lower bound updated to 0.475367

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.492966
    local lower bound updated to 0.492883

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 39.0522 seconds.
    local lower bound updated to 0.345053
    local upper bound updated to 0.457349

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 4.29503 seconds.
    local lower bound updated to 0.417622
    local upper bound updated to 0.45206

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 2.89576 seconds.
    local lower bound updated to 0.43277
    local upper bound updated to 0.433394

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 6.22392 seconds.
    local lower bound updated to 0.43277
    local upper bound updated to 0.433374

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 3.67051 seconds.
    local lower bound updated to 0.43277
    local upper bound updated to 0.433342

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.472113
    local lower bound updated to 0.442174

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.458198
    local lower bound updated to 0.450043

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.450043
    local lower bound updated to 0.450043
The Dual step takes 0.594155 (S)
upper bound updated to 0.450043
*** OUTER ITERATION 2 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 61.3611 seconds.
    local lower bound updated to 0.380373
    local upper bound updated to 0.449648

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 9.76567 seconds.
    local lower bound updated to 0.441076
    local upper bound updated to 0.446675

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 24.8543 seconds.
    local lower bound updated to 0.441076
    local upper bound updated to 0.445756

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 26.8946 seconds.
    local lower bound updated to 0.443376
    local upper bound updated to 0.444079

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 31.2454 seconds.
    local lower bound updated to 0.443376
    local upper bound updated to 0.444064

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.464053
    local lower bound updated to 0.444064

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.456908
    local lower bound updated to 0.445063

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.446138
    local lower bound updated to 0.445143

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.445143
    local lower bound updated to 0.445143
The Dual step takes 3.14994 (S)
upper bound updated to 0.445143
*** OUTER ITERATION 3 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 100.043 seconds.
    local lower bound updated to 0.39366
    local upper bound updated to 0.445102

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 46.979 seconds.
    local lower bound updated to 0.442893
    local upper bound updated to 0.444366

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 45.2117 seconds.
    local lower bound updated to 0.442893
    local upper bound updated to 0.444309

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 42.1779 seconds.
    local lower bound updated to 0.442893
    local upper bound updated to 0.444254

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 54.5999 seconds.
    local lower bound updated to 0.443355
    local upper bound updated to 0.444238

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.465735
    local lower bound updated to 0.444238

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.445122
    local lower bound updated to 0.444461

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.444461
    local lower bound updated to 0.444461
The Dual step takes 5.1163 (S)
upper bound updated to 0.444461
*** OUTER ITERATION 4 ***

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 68.2494 seconds.
    local lower bound updated to 0.395337
    local upper bound updated to 0.44446

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.466564
    local lower bound updated to 0.44446

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 72.6203 seconds.
    local lower bound updated to 0.395337
    local upper bound updated to 0.44446

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 5.90782 seconds.
    local lower bound updated to 0.44446
    local upper bound updated to 0.44446
The time obtain the optimal randomized assortment is 737.583 (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_19_4_100.000000_108620.log"
The computation time limit for a lower bound is 85260
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 128 physical cores, 256 logical processors, using up to 4 threads
Optimize a model with 2136 rows, 1568 columns and 7273 nonzeros
Model fingerprint: 0xa78b9bf2
Variable types: 1495 continuous, 73 integer (73 binary)
Coefficient statistics:
  Matrix range     [3e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 393 rows and 729 columns
Presolve time: 0.02s
Presolved: 1743 rows, 839 columns, 6777 nonzeros
Variable types: 769 continuous, 70 integer (70 binary)
Found heuristic solution: objective 0.6173489
Found heuristic solution: objective 0.5431449

Root relaxation: objective 3.687726e-01, 180 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.36877    0   16    0.54314    0.36877  32.1%     -    0s
H    0     0                       0.5299700    0.36877  30.4%     -    0s
     0     0    0.36877    0   16    0.52997    0.36877  30.4%     -    0s
H    0     0                       0.5100005    0.37025  27.4%     -    0s
H    0     0                       0.4906724    0.38766  21.0%     -    0s
     0     0    0.38766    0   28    0.49067    0.38766  21.0%     -    0s
H    0     0                       0.4459092    0.38766  13.1%     -    0s
     0     0    0.39395    0   28    0.44591    0.39395  11.7%     -    0s
     0     0    0.39506    0   31    0.44591    0.39506  11.4%     -    0s
     0     0    0.39564    0   32    0.44591    0.39564  11.3%     -    0s
     0     0    0.40050    0   32    0.44591    0.40050  10.2%     -    0s
H    0     0                       0.4456633    0.40050  10.1%     -    0s
     0     0    0.40144    0   32    0.44566    0.40144  9.92%     -    0s
     0     0    0.40260    0   32    0.44566    0.40260  9.66%     -    0s
H    0     0                       0.4444603    0.40260  9.42%     -    1s
     0     2    0.40260    0   32    0.44446    0.40260  9.42%     -    1s
H  285   117                       0.4444603    0.41606  6.39%  21.6    2s
H  435   139                       0.4444603    0.41956  5.60%  21.4    2s
  1929   131    0.44240   10   20    0.44446    0.43386  2.38%  20.3    5s

Cutting planes:
  Implied bound: 291
  MIR: 58
  Flow cover: 141
  RLT: 21
  Relax-and-lift: 99

Explored 2420 nodes (49444 simplex iterations) in 5.23 seconds (4.72 work units)
Thread count was 4 (of 256 available processors)

Solution count 9: 0.44446 0.44446 0.445663 ... 0.617349

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

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

        Job resource usage summary 

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

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