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.165958 seconds.
    local lower bound updated to 0.242468
    local upper bound updated to 0.465433

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.580037
    local lower bound updated to 0.563067

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.0921714 seconds.
    local lower bound updated to 0.318967
    local upper bound updated to 0.459875

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.158839 seconds.
    local lower bound updated to 0.44633
    local upper bound updated to 0.45107

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.265348 seconds.
    local lower bound updated to 0.44951
    local upper bound updated to 0.449956

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.249082 seconds.
    local lower bound updated to 0.449904
    local upper bound updated to 0.449941

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.468159
    local lower bound updated to 0.451996

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.456564
    local lower bound updated to 0.45376

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.148409 seconds.
    local lower bound updated to 0.357965
    local upper bound updated to 0.45376

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.600033 seconds.
    local lower bound updated to 0.45151
    local upper bound updated to 0.453497

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.678852 seconds.
    local lower bound updated to 0.452476
    local upper bound updated to 0.453427

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.69513 seconds.
    local lower bound updated to 0.452813
    local upper bound updated to 0.453144

    ++ RESTRICTED PRIMAL ITERATION 5 ++
One worst-case parameter optimization takes 0.702719 seconds.
    local lower bound updated to 0.452813
    local upper bound updated to 0.45309

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.462873
    local lower bound updated to 0.45309

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.454133
    local lower bound updated to 0.45309

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.145682 seconds.
    local lower bound updated to 0.362701
    local upper bound updated to 0.45309

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.405568 seconds.
    local lower bound updated to 0.45309
    local upper bound updated to 0.45309
The time obtain the optimal randomized assortment is 5.8346 (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_13_4_100.000000_106914.log"
The computation time limit for a lower bound is 85993
The model output flag is 1
Gurobi Optimizer version 9.5.1 build v9.5.1rc2 (linux64)
Thread count: 20 physical cores, 40 logical processors, using up to 4 threads
Optimize a model with 960 rows, 834 columns and 3001 nonzeros
Model fingerprint: 0x097a65d8
Variable types: 785 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [2e-06, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [2e-01, 1e+00]
Presolve removed 280 rows and 522 columns
Presolve time: 0.01s
Presolved: 680 rows, 312 columns, 2555 nonzeros
Variable types: 267 continuous, 45 integer (45 binary)
Found heuristic solution: objective 0.6070611
Found heuristic solution: objective 0.6055536
Found heuristic solution: objective 0.5356671

Root relaxation: objective 3.879242e-01, 114 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.38792    0   16    0.53567    0.38792  27.6%     -    0s
H    0     0                       0.4871289    0.38792  20.4%     -    0s
H    0     0                       0.4871216    0.39664  18.6%     -    0s
     0     0    0.39664    0   20    0.48712    0.39664  18.6%     -    0s
H    0     0                       0.4855889    0.39664  18.3%     -    0s
H    0     0                       0.4748076    0.39664  16.5%     -    0s
     0     0    0.41418    0   19    0.47481    0.41418  12.8%     -    0s
H    0     0                       0.4600237    0.41418  10.0%     -    0s
     0     0    0.42018    0   20    0.46002    0.42018  8.66%     -    0s
H    0     0                       0.4555671    0.42018  7.77%     -    0s
H    0     0                       0.4530896    0.43092  4.89%     -    0s
     0     0    0.43092    0   19    0.45309    0.43092  4.89%     -    0s
     0     0    0.43107    0   20    0.45309    0.43107  4.86%     -    0s
     0     0    0.43311    0   18    0.45309    0.43311  4.41%     -    0s
     0     0    0.43377    0   17    0.45309    0.43377  4.26%     -    0s
     0     0    0.43427    0   17    0.45309    0.43427  4.15%     -    0s
     0     2    0.43427    0   17    0.45309    0.43427  4.15%     -    0s

Cutting planes:
  Gomory: 1
  Implied bound: 81
  MIR: 15
  Flow cover: 39
  RLT: 8
  Relax-and-lift: 33

Explored 46 nodes (1439 simplex iterations) in 0.40 seconds (0.16 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.45309 0.455567 0.460024 ... 0.607061

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

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

        Job resource usage summary 

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

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