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

Relaxed solution       23.3259895166 after      18727 iter is B&B base.
 
Feasible solution       23.313425791 after      19123 iter,        33 nodes (gap 0.1%)
Improved solution       23.313529027 after      19193 iter,        39 nodes (gap 0.1%)
Improved solution       23.313593544 after      20458 iter,       190 nodes (gap 0.1%)
Improved solution       23.313606448 after      20695 iter,       219 nodes (gap 0.1%)
Improved solution       23.313619349 after      25403 iter,      1018 nodes (gap 0.1%)
Improved solution       23.313645157 after      25957 iter,      1098 nodes (gap 0.1%)
Improved solution       23.314374174 after      30601 iter,      1827 nodes (gap 0.0%)
Improved solution       23.314477414 after      30632 iter,      1831 nodes (gap 0.0%)
Improved solution       23.314516124 after      30825 iter,      1848 nodes (gap 0.0%)
Improved solution       23.314593551 after      31055 iter,      1870 nodes (gap 0.0%)
Improved solution       23.314632257 after      31410 iter,      1907 nodes (gap 0.0%)
Improved solution       23.314632258 after      31538 iter,      1923 nodes (gap 0.0%)
Improved solution       23.314645155 after      32695 iter,      2067 nodes (gap 0.0%)
Improved solution       23.314670964 after      33291 iter,      2174 nodes (gap 0.0%)
Improved solution       23.314683869 after      35342 iter,      2495 nodes (gap 0.0%)
Improved solution       23.314683875 after      35640 iter,      2537 nodes (gap 0.0%)
Improved solution       23.314696773 after      36618 iter,      2663 nodes (gap 0.0%)
Improved solution        23.31472258 after      38661 iter,      2992 nodes (gap 0.0%)
Improved solution        23.31473548 after      57775 iter,      6500 nodes (gap 0.0%)
Improved solution       23.314735489 after     234559 iter,     44055 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        23.314735489 after     238478 iter,     44700 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 238478, 22873 (9.6%) were bound flips.
      There were 22416 refactorizations, 0 triggered by time and 0 by density.
       ... on average 9.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57929 NZ entries, 1.0x largest basis.
      The maximum B&B level was 56, 0.0x MIP order, 34 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.282 seconds, presolve used 0.197 seconds,
       ... 7199.828 seconds in simplex solver, in total 7200.307 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.471 seconds, presolve used 0.264 seconds,
       ... 315.985 seconds in simplex solver, in total 316.720 seconds.
Vehicle Type: 0 Num:25 Trip segments:98