Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3242 constraints,    5231 variables,        13493 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          4128 iter.

Relaxed solution       778.869589899 after       4650 iter is B&B base.
 
Feasible solution      777.013663208 after       5791 iter,       153 nodes (gap 0.2%)
Improved solution      777.013714866 after       5814 iter,       161 nodes (gap 0.2%)
Improved solution      777.013766524 after       6336 iter,       289 nodes (gap 0.2%)
Improved solution      777.013818178 after       6971 iter,       449 nodes (gap 0.2%)
Improved solution      777.044714866 after       7125 iter,       468 nodes (gap 0.2%)
Improved solution      777.044766524 after       7155 iter,       476 nodes (gap 0.2%)
Improved solution      777.044818178 after       7377 iter,       548 nodes (gap 0.2%)
Improved solution       777.04481818 after       7756 iter,       643 nodes (gap 0.2%)
Improved solution      777.044869834 after       7963 iter,       687 nodes (gap 0.2%)
Improved solution      777.044869836 after       8609 iter,       863 nodes (gap 0.2%)
Improved solution       777.04492149 after       8816 iter,       913 nodes (gap 0.2%)
Improved solution      777.045663208 after      11030 iter,      1566 nodes (gap 0.2%)
Improved solution      777.045714866 after      11061 iter,      1574 nodes (gap 0.2%)
Improved solution      777.045766524 after      11774 iter,      1726 nodes (gap 0.2%)
Improved solution      777.045818178 after      12866 iter,      1974 nodes (gap 0.2%)
Improved solution      777.045818182 after      12982 iter,      1997 nodes (gap 0.2%)
Improved solution      777.045869836 after      13728 iter,      2155 nodes (gap 0.2%)
Improved solution      777.060714866 after      13946 iter,      2176 nodes (gap 0.2%)
Improved solution      777.060766524 after      13986 iter,      2184 nodes (gap 0.2%)
Improved solution      777.060818182 after      14030 iter,      2192 nodes (gap 0.2%)
Improved solution      777.060869836 after      14270 iter,      2264 nodes (gap 0.2%)
Improved solution       777.06092149 after      28887 iter,      6281 nodes (gap 0.2%)
Improved solution      777.060973144 after      60884 iter,     15397 nodes (gap 0.2%)
Improved solution      777.061024798 after     370892 iter,    105395 nodes (gap 0.2%)
Improved solution      777.061076448 after    1427011 iter,    420120 nodes (gap 0.2%)
Improved solution      777.061714866 after    1600784 iter,    474980 nodes (gap 0.2%)
Improved solution      777.061766524 after    1600818 iter,    474989 nodes (gap 0.2%)
Improved solution      777.061818178 after    1601840 iter,    475200 nodes (gap 0.2%)
Improved solution      777.061818182 after    1602102 iter,    475253 nodes (gap 0.2%)
Improved solution      777.061869836 after    1602862 iter,    475411 nodes (gap 0.2%)
Improved solution      777.076663208 after    1603117 iter,    475433 nodes (gap 0.2%)
Improved solution      777.076714866 after    1603174 iter,    475444 nodes (gap 0.2%)
Improved solution      777.076766524 after    1603240 iter,    475458 nodes (gap 0.2%)
Improved solution      777.076818182 after    1603471 iter,    475510 nodes (gap 0.2%)
Improved solution      777.076869836 after    1603677 iter,    475566 nodes (gap 0.2%)
Improved solution       777.07692149 after    1604780 iter,    475809 nodes (gap 0.2%)
Improved solution      777.076973144 after    1612494 iter,    477763 nodes (gap 0.2%)
Improved solution      777.077024798 after    1739249 iter,    510985 nodes (gap 0.2%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       777.077024798 after    2140135 iter,    621522 nodes (gap 0.2%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2140135, 164625 (7.7%) were bound flips.
      There were 310717 refactorizations, 0 triggered by time and 6 by density.
       ... on average 6.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 9396 NZ entries, 1.0x largest basis.
      The maximum B&B level was 168, 0.2x MIP order, 152 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.082 seconds, presolve used 0.029 seconds,
       ... 7199.979 seconds in simplex solver, in total 7200.090 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3242 constraints,    5231 variables,        13493 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       1468 iter is B&B base.
 
Feasible solution                  0 after       1468 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1468 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 1468, 0 (0.0%) were bound flips.
      There were 7 refactorizations, 0 triggered by time and 0 by density.
       ... on average 209.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5745 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.052 seconds, presolve used 0.029 seconds,
       ... 4.483 seconds in simplex solver, in total 4.564 seconds.
Vehicle Type: 0 Num:53 Trip segments:308