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.853353 seconds.
    local lower bound updated to 0.265679
    local upper bound updated to 0.504532

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.631033
    local lower bound updated to 0.62559

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 2.81544 seconds.
    local lower bound updated to 0.307481
    local upper bound updated to 0.518681

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 71.4268 seconds.
    local lower bound updated to 0.505206
    local upper bound updated to 0.513034

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 46.1413 seconds.
    local lower bound updated to 0.506186
    local upper bound updated to 0.507896

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 53.0288 seconds.
    local lower bound updated to 0.507896
    local upper bound updated to 0.507896
The Primal step takes 173.418 (S)
lower bound updated to 0.507896

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.573984
    local lower bound updated to 0.522168

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.537274
    local lower bound updated to 0.523763

    ++ RESTRICTED DUAL ITERATION 3 ++
    local upper bound updated to 0.537274
    local lower bound updated to 0.528041

    ++ RESTRICTED DUAL ITERATION 4 ++
    local upper bound updated to 0.529694
    local lower bound updated to 0.5282

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.021 seconds.
    local lower bound updated to 0.420749
    local upper bound updated to 0.52579

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 33.8998 seconds.
    local lower bound updated to 0.517943
    local upper bound updated to 0.523613

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 55.8021 seconds.
    local lower bound updated to 0.517943
    local upper bound updated to 0.521428

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 103.981 seconds.
    local lower bound updated to 0.517943
    local upper bound updated to 0.52007

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 56.5511 seconds.
    local lower bound updated to 0.519813
    local upper bound updated to 0.519982

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.544437
    local lower bound updated to 0.519982

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 200.028 seconds.
    local lower bound updated to 0.420749
    local upper bound updated to 0.519982

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 47.4217 seconds.
    local lower bound updated to 0.519982
    local upper bound updated to 0.519982
The time obtain the optimal randomized assortment is 921.258 (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_17_4_200.000000_207418.log"
The computation time limit for a lower bound is 85072
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 1440 rows, 1102 columns and 4787 nonzeros
Model fingerprint: 0xd60fd5d6
Variable types: 1037 continuous, 65 integer (65 binary)
Coefficient statistics:
  Matrix range     [1e-03, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [4e-01, 1e+00]
Presolve removed 313 rows and 571 columns
Presolve time: 0.01s
Presolved: 1127 rows, 531 columns, 4404 nonzeros
Variable types: 468 continuous, 63 integer (63 binary)
Found heuristic solution: objective 0.5775223
Found heuristic solution: objective 0.5746912

Root relaxation: objective 4.554174e-01, 161 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.45542    0   14    0.57469    0.45542  20.8%     -    0s
H    0     0                       0.5520315    0.45542  17.5%     -    0s
     0     0    0.45542    0   14    0.55203    0.45542  17.5%     -    0s
H    0     0                       0.5445166    0.45542  16.4%     -    0s
H    0     0                       0.5217312    0.46964  10.0%     -    0s
     0     0    0.46964    0   22    0.52173    0.46964  10.0%     -    0s
     0     0    0.47210    0   23    0.52173    0.47210  9.51%     -    0s
     0     0    0.47232    0   22    0.52173    0.47232  9.47%     -    0s
     0     0    0.47759    0   25    0.52173    0.47759  8.46%     -    0s
     0     0    0.47790    0   24    0.52173    0.47790  8.40%     -    0s
     0     0    0.48044    0   27    0.52173    0.48044  7.92%     -    0s
     0     2    0.48044    0   27    0.52173    0.48044  7.92%     -    0s
H  158   135                       0.5214702    0.48530  6.94%  19.9    1s
H  231   156                       0.5203389    0.48530  6.73%  17.4    1s
H  618   344                       0.5203389    0.49101  5.64%  15.3    1s
H  694   385                       0.5203389    0.49175  5.49%  15.2    1s
H  711   385                       0.5203389    0.49187  5.47%  15.2    1s
H  909   473                       0.5199824    0.49197  5.39%  14.9    1s
  2385   940    0.50480   22   23    0.51998    0.49517  4.77%  16.0    5s
  5661   921 infeasible   28         0.51998    0.50312  3.24%  16.0   10s
H 6329  1008                       0.5199824    0.50370  3.13%  16.0   10s
  8008  1329    0.51025   25   14    0.51998    0.50502  2.88%  16.0   15s
 10719  1597    0.51692   28    8    0.51998    0.50619  2.65%  15.6   20s
H11520  1641                       0.5199824    0.50653  2.59%  15.5   21s
 13356  1774    0.51983   32    8    0.51998    0.50732  2.44%  15.5   25s
H15578  1850                       0.5199824    0.50791  2.32%  15.5   28s
 16244  1873     cutoff   33         0.51998    0.50837  2.23%  15.5   30s
 21312  1800    0.51582   27   14    0.51998    0.51004  1.91%  15.5   35s
 25290  1553    0.51649   29   10    0.51998    0.51137  1.66%  15.6   40s
 30693   744 infeasible   32         0.51998    0.51445  1.06%  15.6   45s

Cutting planes:
  Implied bound: 120
  MIR: 76
  Flow cover: 219
  RLT: 21
  Relax-and-lift: 43

Explored 32634 nodes (508545 simplex iterations) in 46.57 seconds (43.66 work units)
Thread count was 4 (of 256 available processors)

Solution count 9: 0.519982 0.519982 0.520339 ... 0.577522

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

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

        Job resource usage summary 

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

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