Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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          3983 iter.

Relaxed solution       23.2159907561 after       4320 iter is B&B base.
 
Feasible solution       23.200891678 after       4972 iter,        55 nodes (gap 0.1%)
Improved solution       23.200893489 after       5183 iter,        97 nodes (gap 0.1%)
Improved solution       23.200895296 after       8754 iter,       601 nodes (gap 0.1%)
Improved solution       23.201888048 after      10109 iter,       799 nodes (gap 0.1%)
Improved solution       23.201891672 after      10173 iter,       809 nodes (gap 0.1%)
Improved solution       23.201895296 after      10249 iter,       819 nodes (gap 0.1%)
Improved solution       23.201895298 after      17585 iter,      1861 nodes (gap 0.1%)
Improved solution       23.201897103 after      17894 iter,      1908 nodes (gap 0.1%)
Improved solution       23.202891688 after      21754 iter,      2498 nodes (gap 0.1%)
Improved solution       23.202893495 after      21882 iter,      2523 nodes (gap 0.1%)
Improved solution       23.202893501 after      22606 iter,      2640 nodes (gap 0.1%)
Improved solution       23.202895298 after      23692 iter,      2820 nodes (gap 0.1%)
Improved solution       23.202897111 after      23738 iter,      2830 nodes (gap 0.1%)
Improved solution       23.202897117 after      26589 iter,      3297 nodes (gap 0.1%)
Improved solution       23.202898918 after      33655 iter,      4492 nodes (gap 0.1%)
Improved solution       23.202900727 after      34352 iter,      4620 nodes (gap 0.1%)
Improved solution       23.202902528 after      70862 iter,     10702 nodes (gap 0.1%)
Improved solution       23.202904337 after      71854 iter,     10877 nodes (gap 0.1%)
Improved solution       23.202906138 after     104403 iter,     16676 nodes (gap 0.1%)
Improved solution       23.202907947 after     105522 iter,     16887 nodes (gap 0.1%)
Improved solution       23.203875381 after     129543 iter,     20298 nodes (gap 0.1%)
Improved solution       23.203877196 after     129574 iter,     20301 nodes (gap 0.1%)
Improved solution       23.203879009 after     129590 iter,     20305 nodes (gap 0.1%)
Improved solution        23.20388082 after     129708 iter,     20315 nodes (gap 0.1%)
Improved solution       23.203882633 after     129736 iter,     20319 nodes (gap 0.1%)
Improved solution       23.203884444 after     129911 iter,     20331 nodes (gap 0.0%)
Improved solution       23.203886257 after     129938 iter,     20335 nodes (gap 0.0%)
Improved solution       23.203889875 after     130673 iter,     20409 nodes (gap 0.0%)
Improved solution       23.203891686 after     131653 iter,     20517 nodes (gap 0.0%)
Improved solution       23.203893495 after     134142 iter,     20862 nodes (gap 0.0%)
Improved solution       23.203895304 after     165288 iter,     24410 nodes (gap 0.0%)
Improved solution       23.203897111 after     631593 iter,     90740 nodes (gap 0.0%)
Improved solution       23.203898918 after     652866 iter,     93414 nodes (gap 0.0%)
Improved solution       23.203900721 after    1365880 iter,    209400 nodes (gap 0.0%)
Improved solution       23.203902528 after    1397360 iter,    214038 nodes (gap 0.0%)
Improved solution       23.203902536 after    2037501 iter,    320773 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        23.203902536 after    2098063 iter,    330133 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 2098063, 228581 (10.9%) were bound flips.
      There were 165068 refactorizations, 0 triggered by time and 9 by density.
       ... on average 11.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10115 NZ entries, 1.0x largest basis.
      The maximum B&B level was 90, 0.1x MIP order, 70 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.059 seconds, presolve used 0.034 seconds,
       ... 7199.978 seconds in simplex solver, in total 7200.071 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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           105 iter.

Relaxed solution                   0 after       1661 iter is B&B base.
 
Feasible solution                  0 after       1661 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1661 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 1661, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 0 by density.
       ... on average 184.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6954 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.128 seconds, presolve used 0.042 seconds,
       ... 7.676 seconds in simplex solver, in total 7.846 seconds.
Vehicle Type: 0 Num:45 Trip segments:108