Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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          9937 iter.

Relaxed solution       398.607887108 after      11485 iter is B&B base.
 
Feasible solution      398.529843795 after      12100 iter,        60 nodes (gap 0.0%)
Improved solution      398.529846513 after      12312 iter,        94 nodes (gap 0.0%)
Improved solution      398.529849231 after      12547 iter,       129 nodes (gap 0.0%)
Improved solution      398.529851042 after      12917 iter,       198 nodes (gap 0.0%)
Improved solution      398.530846522 after      13068 iter,       216 nodes (gap 0.0%)
Improved solution       398.53084742 after      13357 iter,       287 nodes (gap 0.0%)
Improved solution      398.530849231 after      13492 iter,       316 nodes (gap 0.0%)
Improved solution      398.530851038 after      13890 iter,       396 nodes (gap 0.0%)
Improved solution      398.530852861 after      14221 iter,       433 nodes (gap 0.0%)
Improved solution      398.530853755 after      15198 iter,       592 nodes (gap 0.0%)
Improved solution      398.530855567 after      15247 iter,       598 nodes (gap 0.0%)
Improved solution       398.53184925 after      15560 iter,       629 nodes (gap 0.0%)
Improved solution      398.531851959 after      15624 iter,       639 nodes (gap 0.0%)
Improved solution      398.531853756 after      18017 iter,      1064 nodes (gap 0.0%)
Improved solution      398.531854665 after      18541 iter,      1137 nodes (gap 0.0%)
Improved solution      398.531857374 after      19145 iter,      1273 nodes (gap 0.0%)
Improved solution      398.531859181 after      19725 iter,      1346 nodes (gap 0.0%)
Improved solution      398.535850152 after      27410 iter,      2144 nodes (gap 0.0%)
Improved solution      398.538848337 after      27628 iter,      2168 nodes (gap 0.0%)
Improved solution      398.539849246 after      29620 iter,      2533 nodes (gap 0.0%)
Improved solution      398.539850144 after      31199 iter,      2962 nodes (gap 0.0%)
Improved solution      398.539851951 after      31621 iter,      3047 nodes (gap 0.0%)
Improved solution      398.539853774 after      32268 iter,      3162 nodes (gap 0.0%)
Improved solution       398.54084564 after      33000 iter,      3228 nodes (gap 0.0%)
Improved solution      398.540848349 after      33068 iter,      3235 nodes (gap 0.0%)
Improved solution      398.540851065 after      33453 iter,      3280 nodes (gap 0.0%)
Improved solution      398.540852872 after      33723 iter,      3305 nodes (gap 0.0%)
Improved solution       398.54085377 after      34154 iter,      3346 nodes (gap 0.0%)
Improved solution      398.540853774 after      43152 iter,      4151 nodes (gap 0.0%)
Improved solution      398.540854675 after     115032 iter,     11598 nodes (gap 0.0%)
Improved solution      398.540855573 after     115802 iter,     11700 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       398.540855573 after     968898 iter,     96899 nodes (gap 0.0%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 968898, 80921 (8.4%) were bound flips.
      There were 48483 refactorizations, 0 triggered by time and 3 by density.
       ... on average 18.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22405 NZ entries, 1.0x largest basis.
      The maximum B&B level was 76, 0.0x MIP order, 65 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.176 seconds, presolve used 0.073 seconds,
       ... 7199.936 seconds in simplex solver, in total 7200.185 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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           105 iter.

Relaxed solution                   0 after       3479 iter is B&B base.
 
Feasible solution                  0 after       3479 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3479 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 3479, 0 (0.0%) were bound flips.
      There were 16 refactorizations, 0 triggered by time and 0 by density.
       ... on average 217.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14574 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.190 seconds, presolve used 0.080 seconds,
       ... 33.773 seconds in simplex solver, in total 34.043 seconds.
Vehicle Type: 0 Num:54 Trip segments:160