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

Relaxed solution        792.49779875 after      10163 iter is B&B base.
 
Feasible solution       791.47436919 after      11094 iter,        41 nodes (gap 0.1%)
Improved solution      791.474382204 after      11112 iter,        44 nodes (gap 0.1%)
Improved solution      791.474408226 after      11137 iter,        50 nodes (gap 0.1%)
Improved solution      791.490395217 after      11346 iter,        75 nodes (gap 0.1%)
Improved solution      791.510408228 after      12099 iter,       162 nodes (gap 0.1%)
Improved solution      791.524401723 after      12927 iter,       235 nodes (gap 0.1%)
Improved solution      791.524408228 after      13235 iter,       262 nodes (gap 0.1%)
Improved solution      791.538388709 after      16121 iter,       571 nodes (gap 0.1%)
Improved solution      791.538395215 after      16313 iter,       600 nodes (gap 0.1%)
Improved solution      791.541401721 after      16822 iter,       660 nodes (gap 0.1%)
Improved solution      791.558388709 after      16839 iter,       663 nodes (gap 0.1%)
Improved solution      791.558395215 after      17077 iter,       693 nodes (gap 0.1%)
Improved solution      791.559375699 after      18979 iter,       862 nodes (gap 0.1%)
Improved solution       791.57335618 after      19105 iter,       878 nodes (gap 0.1%)
Improved solution      791.573369193 after      19234 iter,       897 nodes (gap 0.1%)
Improved solution      791.575369193 after      21074 iter,      1056 nodes (gap 0.1%)
Improved solution      791.575375697 after      21220 iter,      1075 nodes (gap 0.1%)
Improved solution      791.575375698 after      21276 iter,      1085 nodes (gap 0.1%)
Improved solution      791.576382208 after      22329 iter,      1165 nodes (gap 0.1%)
Improved solution      791.579375702 after      23593 iter,      1277 nodes (gap 0.1%)
Improved solution      791.588382206 after      94307 iter,      6899 nodes (gap 0.1%)
Improved solution      791.591375703 after    1003463 iter,     87481 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       791.591375703 after    1047738 iter,     91860 nodes (gap 0.1%).

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 1047738, 52882 (5.0%) were bound flips.
      There were 45999 refactorizations, 0 triggered by time and 37 by density.
       ... on average 21.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22091 NZ entries, 1.0x largest basis.
      The maximum B&B level was 52, 0.0x MIP order, 52 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.193 seconds, presolve used 0.097 seconds,
       ... 7199.920 seconds in simplex solver, in total 7200.210 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.173 seconds, presolve used 0.073 seconds,
       ... 30.887 seconds in simplex solver, in total 31.133 seconds.
Vehicle Type: 0 Num:28 Trip segments:96