Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 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         29440 iter.

Relaxed solution       772.535679433 after      34954 iter is B&B base.
 
Feasible solution      770.009629675 after      48865 iter,        91 nodes (gap 0.3%)
Improved solution      770.023626926 after      48906 iter,        98 nodes (gap 0.3%)
Improved solution      770.023629676 after      48915 iter,       101 nodes (gap 0.3%)
Improved solution      770.036629675 after      49015 iter,       113 nodes (gap 0.3%)
Improved solution      770.036629676 after      49167 iter,       134 nodes (gap 0.3%)
Improved solution      770.036630591 after      49370 iter,       158 nodes (gap 0.3%)
Improved solution      770.045630595 after      49621 iter,       188 nodes (gap 0.3%)
Improved solution      770.045630596 after      49778 iter,       208 nodes (gap 0.3%)
Improved solution      770.992628762 after      51113 iter,       247 nodes (gap 0.2%)
Improved solution      771.015627844 after      51436 iter,       254 nodes (gap 0.2%)
Improved solution      772.010626013 after      53917 iter,       322 nodes (gap 0.1%)
Improved solution      772.011625097 after      54007 iter,       330 nodes (gap 0.1%)
Improved solution       772.01162876 after      54538 iter,       370 nodes (gap 0.1%)
Improved solution      772.018625096 after      54829 iter,       397 nodes (gap 0.1%)
Improved solution      772.028622351 after      57456 iter,       593 nodes (gap 0.1%)
Improved solution      772.028625099 after      57467 iter,       596 nodes (gap 0.1%)
Improved solution      772.042626017 after      58973 iter,       684 nodes (gap 0.1%)
Improved solution      772.053622351 after      58978 iter,       686 nodes (gap 0.1%)
Improved solution      772.053625099 after      58992 iter,       689 nodes (gap 0.1%)
Improved solution      772.054626016 after      72615 iter,      1888 nodes (gap 0.1%)
Improved solution      772.054628764 after      72932 iter,      1910 nodes (gap 0.1%)
Improved solution       772.05562602 after      84817 iter,      3084 nodes (gap 0.1%)
Improved solution      772.055628768 after      92053 iter,      3580 nodes (gap 0.1%)
Improved solution      772.056626935 after      92212 iter,      3594 nodes (gap 0.1%)
Improved solution      772.057627851 after      92252 iter,      3603 nodes (gap 0.1%)
Improved solution      772.062625103 after     123126 iter,      5912 nodes (gap 0.1%)
Improved solution      772.063623274 after     125258 iter,      6070 nodes (gap 0.1%)
Improved solution       772.06462419 after     125305 iter,      6073 nodes (gap 0.1%)
Improved solution      772.065620521 after     126136 iter,      6127 nodes (gap 0.1%)
Improved solution      772.065623269 after     126211 iter,      6135 nodes (gap 0.1%)
Improved solution      772.065626936 after     126561 iter,      6169 nodes (gap 0.1%)
Improved solution      772.070626936 after     126671 iter,      6178 nodes (gap 0.1%)
Improved solution      772.072629684 after     126919 iter,      6195 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       772.072629684 after     378425 iter,     23944 nodes (gap 0.1%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 378425, 20995 (5.5%) were bound flips.
      There were 12160 refactorizations, 0 triggered by time and 29 by density.
       ... on average 29.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 61005 NZ entries, 1.0x largest basis.
      The maximum B&B level was 126, 0.0x MIP order, 100 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.303 seconds, presolve used 0.187 seconds,
       ... 7199.837 seconds in simplex solver, in total 7200.327 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 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          1386 iter.

Relaxed solution                   0 after      10678 iter is B&B base.
 
Feasible solution                  0 after      10678 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after      10678 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 10678, 0 (0.0%) were bound flips.
      There were 45 refactorizations, 0 triggered by time and 0 by density.
       ... on average 237.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 45281 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.300 seconds, presolve used 0.193 seconds,
       ... 247.715 seconds in simplex solver, in total 248.208 seconds.
Vehicle Type: 0 Num:50 Trip segments:408