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

Relaxed solution        784.08170213 after      19964 iter is B&B base.
 
Feasible solution      783.790316143 after      20404 iter,        53 nodes (gap 0.0%)
Improved solution       783.79039357 after      20568 iter,        75 nodes (gap 0.0%)
Improved solution      783.790470994 after      20956 iter,       123 nodes (gap 0.0%)
Improved solution      783.790548415 after      21596 iter,       217 nodes (gap 0.0%)
Improved solution      783.790612936 after      23401 iter,       616 nodes (gap 0.0%)
Improved solution      783.790625837 after      24069 iter,       788 nodes (gap 0.0%)
Improved solution      783.790690355 after      37917 iter,      4757 nodes (gap 0.0%)
Improved solution      783.790729064 after      40192 iter,      5481 nodes (gap 0.0%)
Improved solution      783.790741965 after      42148 iter,      5888 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       783.790741965 after     256795 iter,     59105 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 256795, 21737 (8.5%) were bound flips.
      There were 29615 refactorizations, 0 triggered by time and 0 by density.
       ... on average 7.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57912 NZ entries, 1.0x largest basis.
      The maximum B&B level was 83, 0.0x MIP order, 54 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.297 seconds, presolve used 0.185 seconds,
       ... 7199.863 seconds in simplex solver, in total 7200.345 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 ||*|| = 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 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 128, with a dynamic range of 128000.
      Time to load data was 0.309 seconds, presolve used 0.188 seconds,
       ... 227.289 seconds in simplex solver, in total 227.786 seconds.
Vehicle Type: 0 Num:47 Trip segments:175