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.174328 seconds.
    local lower bound updated to 0.25058
    local upper bound updated to 0.497868

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.543933
    local lower bound updated to 0.542898

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.543933
    local lower bound updated to 0.543811

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.353854 seconds.
    local lower bound updated to 0.358949
    local upper bound updated to 0.500619

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.455223 seconds.
    local lower bound updated to 0.497672
    local upper bound updated to 0.498416

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.459517 seconds.
    local lower bound updated to 0.498058
    local upper bound updated to 0.498308

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.530121
    local lower bound updated to 0.498982

    ++ RESTRICTED DUAL ITERATION 2 ++
    local upper bound updated to 0.501671
    local lower bound updated to 0.499188

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.561707 seconds.
    local lower bound updated to 0.400837
    local upper bound updated to 0.499188

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.63409 seconds.
    local lower bound updated to 0.496181
    local upper bound updated to 0.498558

    ++ RESTRICTED PRIMAL ITERATION 3 ++
One worst-case parameter optimization takes 0.751614 seconds.
    local lower bound updated to 0.498259
    local upper bound updated to 0.498492

    ++ RESTRICTED PRIMAL ITERATION 4 ++
One worst-case parameter optimization takes 0.625391 seconds.
    local lower bound updated to 0.498275
    local upper bound updated to 0.498398

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

    ++ RESTRICTED DUAL ITERATION 1 ++
    local upper bound updated to 0.518667
    local lower bound updated to 0.498398

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

    ++ RESTRICTED PRIMAL ITERATION 1 ++
One worst-case parameter optimization takes 0.561193 seconds.
    local lower bound updated to 0.400837
    local upper bound updated to 0.498398

    ++ RESTRICTED PRIMAL ITERATION 2 ++
One worst-case parameter optimization takes 0.464628 seconds.
    local lower bound updated to 0.498398
    local upper bound updated to 0.498398
The time obtain the optimal randomized assortment is 6.6655 (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_109214.log"
The computation time limit for a lower bound is 85992
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 834 rows, 722 columns and 2595 nonzeros
Model fingerprint: 0x1d6873b7
Variable types: 673 continuous, 49 integer (49 binary)
Coefficient statistics:
  Matrix range     [5e-04, 1e+00]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+00]
  RHS range        [6e-01, 1e+00]
Presolve removed 259 rows and 447 columns
Presolve time: 0.01s
Presolved: 575 rows, 275 columns, 2157 nonzeros
Variable types: 229 continuous, 46 integer (46 binary)
Found heuristic solution: objective 0.5407770

Root relaxation: objective 4.146142e-01, 94 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.41461    0   14    0.54078    0.41461  23.3%     -    0s
H    0     0                       0.5368528    0.41670  22.4%     -    0s
     0     0    0.41670    0   16    0.53685    0.41670  22.4%     -    0s
H    0     0                       0.5315900    0.44132  17.0%     -    0s
H    0     0                       0.5140542    0.44132  14.1%     -    0s
     0     0    0.44132    0   18    0.51405    0.44132  14.1%     -    0s
H    0     0                       0.5008714    0.44132  11.9%     -    0s
     0     0    0.45503    0   18    0.50087    0.45503  9.15%     -    0s
H    0     0                       0.4996780    0.46320  7.30%     -    0s
H    0     0                       0.4990355    0.46320  7.18%     -    0s
     0     0    0.46320    0   20    0.49904    0.46320  7.18%     -    0s
H    0     0                       0.4989551    0.46504  6.80%     -    0s
H    0     0                       0.4984872    0.46504  6.71%     -    0s
     0     0    0.46550    0   20    0.49849    0.46550  6.62%     -    0s
     0     0    0.46971    0   21    0.49849    0.46971  5.77%     -    0s
     0     0    0.47027    0   19    0.49849    0.47027  5.66%     -    0s
     0     0    0.47116    0   18    0.49849    0.47116  5.48%     -    0s
     0     2    0.47116    0   18    0.49849    0.47116  5.48%     -    0s
H    4     8                       0.4984690    0.47556  4.60%  38.5    0s
*   47     5              13       0.4983975    0.48925  1.83%  18.0    0s

Cutting planes:
  Implied bound: 60
  MIR: 13
  Flow cover: 53
  RLT: 8
  Relax-and-lift: 22

Explored 81 nodes (1953 simplex iterations) in 0.46 seconds (0.13 work units)
Thread count was 4 (of 40 available processors)

Solution count 10: 0.498398 0.498469 0.498487 ... 0.536853

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

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

        Job resource usage summary 

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

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