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

Relaxed solution        401.17783211 after      29338 iter is B&B base.
 
Feasible solution      400.844791823 after      31122 iter,        61 nodes (gap 0.1%)
Improved solution      400.847791825 after      31285 iter,        96 nodes (gap 0.1%)
Improved solution      400.847791826 after      31443 iter,       114 nodes (gap 0.1%)
Improved solution      400.849791823 after      35625 iter,       634 nodes (gap 0.1%)
Improved solution      400.852791825 after      35795 iter,       663 nodes (gap 0.1%)
Improved solution      400.852791826 after      35967 iter,       681 nodes (gap 0.1%)
Improved solution      400.852792735 after      42203 iter,      1420 nodes (gap 0.1%)
Improved solution      400.853792738 after      42399 iter,      1457 nodes (gap 0.1%)
Improved solution      400.857792735 after      48216 iter,      2083 nodes (gap 0.1%)
Improved solution      400.858792738 after      48414 iter,      2114 nodes (gap 0.1%)
Improved solution      400.860781832 after     120377 iter,      9016 nodes (gap 0.1%)
Improved solution      400.860787289 after     120595 iter,      9030 nodes (gap 0.1%)
Improved solution      400.860791826 after     128866 iter,      9856 nodes (gap 0.1%)
Improved solution      400.861776375 after     136378 iter,     10630 nodes (gap 0.1%)
Improved solution      400.861781835 after     137347 iter,     10692 nodes (gap 0.1%)
Improved solution      400.861787289 after     139286 iter,     10822 nodes (gap 0.1%)
Improved solution      400.861789099 after     158670 iter,     12381 nodes (gap 0.1%)
Improved solution      400.861789101 after     160657 iter,     12591 nodes (gap 0.1%)
Improved solution      400.863780023 after     251890 iter,     21009 nodes (gap 0.1%)
Improved solution      400.863780921 after     260697 iter,     22846 nodes (gap 0.1%)
Improved solution      400.864780026 after     260826 iter,     22882 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       400.864780026 after     317043 iter,     28586 nodes (gap 0.1%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 317043, 19354 (6.1%) were bound flips.
      There were 14393 refactorizations, 0 triggered by time and 1 by density.
       ... on average 20.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 59702 NZ entries, 1.0x largest basis.
      The maximum B&B level was 105, 0.0x MIP order, 70 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.316 seconds, presolve used 0.222 seconds,
       ... 7199.810 seconds in simplex solver, in total 7200.348 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.338 seconds, presolve used 0.191 seconds,
       ... 249.742 seconds in simplex solver, in total 250.271 seconds.
Vehicle Type: 0 Num:44 Trip segments:243