Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after         17119 iter.

Relaxed solution         22.31798883 after      18916 iter is B&B base.
 
Feasible solution       22.309905155 after      19326 iter,        28 nodes (gap 0.0%)
Improved solution       22.309906963 after      19389 iter,        34 nodes (gap 0.0%)
Improved solution       22.309907853 after      19470 iter,        45 nodes (gap 0.0%)
Improved solution       22.309909675 after      19591 iter,        55 nodes (gap 0.0%)
Improved solution       22.309911483 after      19653 iter,        61 nodes (gap 0.0%)
Improved solution       22.309912379 after      19717 iter,        70 nodes (gap 0.0%)
Improved solution       22.309913292 after      22544 iter,       385 nodes (gap 0.0%)
Improved solution       22.309914188 after      22708 iter,       416 nodes (gap 0.0%)
Improved solution       22.309914189 after      27357 iter,      1138 nodes (gap 0.0%)
Improved solution       22.309914196 after      34251 iter,      1958 nodes (gap 0.0%)
Improved solution       22.309915093 after      34377 iter,      1978 nodes (gap 0.0%)
Improved solution       22.309915098 after      34565 iter,      1997 nodes (gap 0.0%)
Improved solution       22.309915997 after      34958 iter,      2052 nodes (gap 0.0%)
Improved solution       22.309916001 after      42461 iter,      3048 nodes (gap 0.0%)
Improved solution       22.309916905 after      42483 iter,      3051 nodes (gap 0.0%)
Improved solution       22.309916907 after      42611 iter,      3071 nodes (gap 0.0%)
Improved solution       22.309917807 after      42779 iter,      3100 nodes (gap 0.0%)
Improved solution       22.309919617 after      45717 iter,      3580 nodes (gap 0.0%)
Improved solution       22.309920517 after      45885 iter,      3607 nodes (gap 0.0%)
Improved solution       22.309920519 after      46087 iter,      3645 nodes (gap 0.0%)
Improved solution       22.309921418 after      46225 iter,      3670 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        22.309921418 after     277650 iter,     37288 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 5.48606e-17

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 277650, 14067 (5.1%) were bound flips.
      There were 18713 refactorizations, 0 triggered by time and 2 by density.
       ... on average 14.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57909 NZ entries, 1.0x largest basis.
      The maximum B&B level was 54, 0.0x MIP order, 33 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.323 seconds, presolve used 0.191 seconds,
       ... 7199.825 seconds in simplex solver, in total 7200.339 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after          1386 iter.

Relaxed solution                   0 after      10678 iter is B&B base.
 
Feasible solution                  0 after      10678 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after      10678 iter,         0 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 10678, 0 (0.0%) were bound flips.
      There were 45 refactorizations, 0 triggered by time and 0 by density.
       ... on average 237.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 45281 NZ entries, 1.0x largest basis.
      The maximum B&B level was 1, 0.0x MIP order, 1 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.340 seconds, presolve used 0.188 seconds,
       ... 295.269 seconds in simplex solver, in total 295.797 seconds.
Vehicle Type: 0 Num:21 Trip segments:87