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

Relaxed solution       378.330857653 after      19709 iter is B&B base.
 
Feasible solution      378.194718883 after      20071 iter,        51 nodes (gap 0.0%)
Improved solution       378.19475791 after      20253 iter,        79 nodes (gap 0.0%)
Improved solution      378.194796934 after      20649 iter,       139 nodes (gap 0.0%)
Improved solution      378.194835955 after      21260 iter,       233 nodes (gap 0.0%)
Improved solution      378.194855464 after      24238 iter,      1179 nodes (gap 0.0%)
Improved solution      378.194861965 after      26192 iter,      1582 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       378.194861965 after     249042 iter,     69501 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 249042, 28094 (11.3%) were bound flips.
      There were 34811 refactorizations, 0 triggered by time and 0 by density.
       ... on average 6.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57879 NZ entries, 1.0x largest basis.
      The maximum B&B level was 84, 0.0x MIP order, 54 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.319 seconds, presolve used 0.192 seconds,
       ... 7199.832 seconds in simplex solver, in total 7200.343 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.

Relaxed solution                   0 after       9294 iter is B&B base.
 
Feasible solution                  0 after       9294 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       9294 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 9294, 0 (0.0%) were bound flips.
      There were 39 refactorizations, 0 triggered by time and 0 by density.
       ... on average 238.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 39176 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 64, with a dynamic range of 64000.
      Time to load data was 0.327 seconds, presolve used 0.188 seconds,
       ... 237.532 seconds in simplex solver, in total 238.047 seconds.
Vehicle Type: 0 Num:47 Trip segments:175