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

Relaxed solution       23.3249884926 after      19109 iter is B&B base.
 
Feasible solution       23.324915148 after      19206 iter,        23 nodes (gap 0.0%)
Improved solution       23.324916956 after      19249 iter,        35 nodes (gap 0.0%)
Improved solution       23.324918769 after      19279 iter,        46 nodes (gap 0.0%)
Improved solution       23.324918771 after      19413 iter,        98 nodes (gap 0.0%)
Improved solution       23.324921472 after      19611 iter,       155 nodes (gap 0.0%)
Improved solution       23.324923285 after      19644 iter,       166 nodes (gap 0.0%)
Improved solution       23.324923287 after      19763 iter,       212 nodes (gap 0.0%)
Improved solution       23.324925993 after      19925 iter,       265 nodes (gap 0.0%)
Improved solution       23.324926893 after      20601 iter,       570 nodes (gap 0.0%)
Improved solution       23.324926896 after      21409 iter,       938 nodes (gap 0.0%)
Improved solution       23.324929602 after      22305 iter,      1291 nodes (gap 0.0%)
Improved solution       23.324932308 after      23837 iter,      1954 nodes (gap 0.0%)
 
Optimal solution        23.324932308 after      23974 iter,      2012 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 23974, 865 (3.6%) were bound flips.
      There were 1085 refactorizations, 0 triggered by time and 0 by density.
       ... on average 21.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57815 NZ entries, 1.0x largest basis.
      The maximum B&B level was 32, 0.0x MIP order, 29 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.348 seconds, presolve used 0.199 seconds,
       ... 553.614 seconds in simplex solver, in total 554.161 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          2111 iter.

Relaxed solution                   0 after      11416 iter is B&B base.
 
Feasible solution                  0 after      11416 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after      11416 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 11416, 0 (0.0%) were bound flips.
      There were 48 refactorizations, 0 triggered by time and 0 by density.
       ... on average 237.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 48380 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.347 seconds, presolve used 0.213 seconds,
       ... 304.253 seconds in simplex solver, in total 304.813 seconds.
Vehicle Type: 0 Num:21 Trip segments:75