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

Relaxed solution       378.081869022 after       7128 iter is B&B base.
 
Feasible solution      377.944817401 after       7946 iter,        71 nodes (gap 0.0%)
Improved solution      377.944821025 after       9789 iter,       349 nodes (gap 0.0%)
Improved solution      377.944822838 after      13474 iter,       860 nodes (gap 0.0%)
Improved solution      377.944824653 after      13839 iter,       928 nodes (gap 0.0%)
Improved solution      377.944826464 after      27497 iter,      3156 nodes (gap 0.0%)
Improved solution      377.944828279 after      27844 iter,      3224 nodes (gap 0.0%)
Improved solution      377.944830092 after      64965 iter,     11623 nodes (gap 0.0%)
Improved solution      377.948821029 after      76045 iter,     13971 nodes (gap 0.0%)
Improved solution      377.948822838 after      76516 iter,     14079 nodes (gap 0.0%)
Improved solution      377.948824653 after      80373 iter,     14941 nodes (gap 0.0%)
Improved solution      377.948826462 after      80789 iter,     15049 nodes (gap 0.0%)
Improved solution      377.950822838 after      87279 iter,     16447 nodes (gap 0.0%)
Improved solution      377.950826462 after      88062 iter,     16667 nodes (gap 0.0%)
Improved solution      377.951810145 after     923401 iter,    147281 nodes (gap 0.0%)
Improved solution      377.951811958 after     924213 iter,    147451 nodes (gap 0.0%)
Improved solution      377.951813775 after     924388 iter,    147481 nodes (gap 0.0%)
Improved solution      377.951815584 after     925765 iter,    147748 nodes (gap 0.0%)
Improved solution      377.951817399 after     935606 iter,    149323 nodes (gap 0.0%)
Improved solution      377.951819208 after     937071 iter,    149610 nodes (gap 0.0%)
Improved solution      377.951821023 after     966715 iter,    153645 nodes (gap 0.0%)
Improved solution      377.951821025 after     966830 iter,    153664 nodes (gap 0.0%)
Improved solution      377.951822834 after    1165350 iter,    179835 nodes (gap 0.0%)
Improved solution      377.951822838 after    1212362 iter,    186351 nodes (gap 0.0%)
Improved solution      377.951824651 after    1267213 iter,    195071 nodes (gap 0.0%)
Improved solution       377.95182646 after    1538420 iter,    233615 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        377.95182646 after    2377456 iter,    332346 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 8.88178e-16

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2377456, 228118 (9.6%) were bound flips.
      There were 166241 refactorizations, 0 triggered by time and 74 by density.
       ... on average 12.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10827 NZ entries, 1.1x largest basis.
      The maximum B&B level was 101, 0.1x MIP order, 92 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.069 seconds, presolve used 0.040 seconds,
       ... 7199.966 seconds in simplex solver, in total 7200.075 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.061 seconds, presolve used 0.033 seconds,
       ... 5.536 seconds in simplex solver, in total 5.630 seconds.
Vehicle Type: 0 Num:49 Trip segments:192