Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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          7117 iter.

Relaxed solution       23.2239935999 after       8257 iter is B&B base.
 
Feasible solution       23.211635878 after       8676 iter,        24 nodes (gap 0.1%)
Improved solution       23.213622869 after       8708 iter,        27 nodes (gap 0.0%)
Improved solution       23.213635874 after       8735 iter,        31 nodes (gap 0.0%)
Improved solution       23.213648879 after       8839 iter,        42 nodes (gap 0.0%)
Improved solution       23.213674895 after       8952 iter,        56 nodes (gap 0.0%)
Improved solution       23.213700905 after       9004 iter,        63 nodes (gap 0.0%)
Improved solution        23.21463587 after      22690 iter,      1469 nodes (gap 0.0%)
Improved solution       23.214642375 after      22796 iter,      1488 nodes (gap 0.0%)
Improved solution       23.214661884 after      22809 iter,      1493 nodes (gap 0.0%)
Improved solution       23.214674889 after      23581 iter,      1656 nodes (gap 0.0%)
Improved solution       23.214674895 after      23787 iter,      1699 nodes (gap 0.0%)
Improved solution       23.214700905 after      24171 iter,      1772 nodes (gap 0.0%)
Improved solution       23.214700906 after      25768 iter,      1990 nodes (gap 0.0%)
Improved solution       23.215648881 after      60435 iter,      5523 nodes (gap 0.0%)
Improved solution       23.215661888 after      60744 iter,      5558 nodes (gap 0.0%)
Improved solution       23.215674888 after      61155 iter,      5596 nodes (gap 0.0%)
Improved solution       23.215687902 after      61341 iter,      5613 nodes (gap 0.0%)
Improved solution       23.215700905 after      69113 iter,      6526 nodes (gap 0.0%)
Improved solution       23.215700908 after      72341 iter,      7024 nodes (gap 0.0%)
Improved solution       23.216700906 after      92545 iter,      9968 nodes (gap 0.0%)
Improved solution        23.21670741 after      92819 iter,      9996 nodes (gap 0.0%)
Improved solution        23.21770741 after      93531 iter,     10068 nodes (gap 0.0%)
Improved solution       23.217707411 after      93716 iter,     10084 nodes (gap 0.0%)
Improved solution       23.218700907 after      96622 iter,     10402 nodes (gap 0.0%)
Improved solution       23.218700908 after      96723 iter,     10415 nodes (gap 0.0%)
Improved solution       23.218707411 after      96867 iter,     10435 nodes (gap 0.0%)
Improved solution       23.218707412 after      96983 iter,     10452 nodes (gap 0.0%)
Improved solution       23.218707413 after     100230 iter,     10909 nodes (gap 0.0%)
 
Optimal solution        23.218707413 after     107784 iter,     11906 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 7.10543e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 107784, 7212 (6.7%) were bound flips.
      There were 5990 refactorizations, 0 triggered by time and 0 by density.
       ... on average 16.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22104 NZ entries, 1.0x largest basis.
      The maximum B&B level was 41, 0.0x MIP order, 24 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.207 seconds, presolve used 0.075 seconds,
       ... 731.994 seconds in simplex solver, in total 732.276 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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       3376 iter is B&B base.
 
Feasible solution                  0 after       3376 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3376 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 3376, 0 (0.0%) were bound flips.
      There were 15 refactorizations, 0 triggered by time and 0 by density.
       ... on average 225.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14150 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.180 seconds, presolve used 0.077 seconds,
       ... 34.186 seconds in simplex solver, in total 34.443 seconds.
Vehicle Type: 0 Num:20 Trip segments:45