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         16618 iter.

Relaxed solution       25.3559892301 after      18683 iter is B&B base.
 
Feasible solution       25.355115639 after      18937 iter,        37 nodes (gap 0.0%)
Improved solution       25.355115642 after      19044 iter,        75 nodes (gap 0.0%)
Improved solution       25.355122153 after      19809 iter,       291 nodes (gap 0.0%)
Improved solution       25.355128652 after      20213 iter,       422 nodes (gap 0.0%)
Improved solution       25.355128653 after      20265 iter,       442 nodes (gap 0.0%)
Improved solution       25.355128656 after      20316 iter,       460 nodes (gap 0.0%)
Improved solution       25.355135152 after      20856 iter,       633 nodes (gap 0.0%)
Improved solution       25.355135155 after      20911 iter,       653 nodes (gap 0.0%)
Improved solution       25.355135156 after      23477 iter,      1459 nodes (gap 0.0%)
Improved solution       25.355141651 after      24502 iter,      1774 nodes (gap 0.0%)
Improved solution       25.355141653 after      24743 iter,      1862 nodes (gap 0.0%)
Improved solution       25.355141663 after      27180 iter,      2532 nodes (gap 0.0%)
Improved solution       25.355148162 after      27654 iter,      2663 nodes (gap 0.0%)
Improved solution       25.355148163 after      27716 iter,      2683 nodes (gap 0.0%)
Improved solution       25.355148166 after      27776 iter,      2701 nodes (gap 0.0%)
Improved solution       25.355148169 after      34931 iter,      4838 nodes (gap 0.0%)
Improved solution       25.355161177 after      36481 iter,      5336 nodes (gap 0.0%)
Improved solution       25.355167676 after      38290 iter,      5919 nodes (gap 0.0%)
Improved solution       25.355167679 after      41302 iter,      6825 nodes (gap 0.0%)
Improved solution       25.355174174 after      63898 iter,     13350 nodes (gap 0.0%)
Improved solution       25.355174176 after      66995 iter,     14226 nodes (gap 0.0%)

lp_solve optimization was stopped by the user.
 
Subopt. solution        25.355174176 after     131848 iter,     33941 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 3.55271e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 131848, 16622 (12.6%) were bound flips.
      There were 17029 refactorizations, 0 triggered by time and 0 by density.
       ... on average 6.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57773 NZ entries, 1.0x largest basis.
      The maximum B&B level was 53, 0.0x MIP order, 42 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.312 seconds, presolve used 0.208 seconds,
       ... 4996.428 seconds in simplex solver, in total 4996.948 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             2 iter.

lp_solve optimization was stopped by the user.
 
Optimal solution                   0 after       6896 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 6896, 0 (0.0%) were bound flips.
      There were 29 refactorizations, 0 triggered by time and 0 by density.
       ... on average 237.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 34175 NZ entries, 1.0x largest basis.
      The maximum B&B level was 1, 0.0x MIP order, with 0 nodes explored.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.460 seconds, presolve used 0.231 seconds,
       ... 403.103 seconds in simplex solver, in total 403.794 seconds.
Vehicle Type: 0 Num:37 Trip segments:127