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

Relaxed solution       786.074692852 after      22204 iter is B&B base.
 
Feasible solution      785.319991914 after      22703 iter,        37 nodes (gap 0.1%)
Improved solution      785.326985409 after      22752 iter,        43 nodes (gap 0.1%)
Improved solution       785.32698541 after      25938 iter,       688 nodes (gap 0.1%)
Improved solution      785.327991909 after     114275 iter,     16405 nodes (gap 0.1%)
Improved solution      785.341991915 after     114360 iter,     16420 nodes (gap 0.1%)
Improved solution      785.341991916 after     116973 iter,     16683 nodes (gap 0.1%)
Improved solution      785.353991918 after     136338 iter,     18984 nodes (gap 0.1%)
Improved solution      785.353991919 after     137396 iter,     19148 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       785.353991919 after     321626 iter,     43848 nodes (gap 0.1%).

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 321626, 22028 (6.8%) were bound flips.
      There were 22001 refactorizations, 0 triggered by time and 0 by density.
       ... on average 13.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 58210 NZ entries, 1.0x largest basis.
      The maximum B&B level was 66, 0.0x MIP order, 48 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.294 seconds, presolve used 0.186 seconds,
       ... 7199.839 seconds in simplex solver, in total 7200.319 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.311 seconds, presolve used 0.188 seconds,
       ... 225.737 seconds in simplex solver, in total 226.236 seconds.
Vehicle Type: 0 Num:36 Trip segments:155