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

Relaxed solution       395.574849604 after      19409 iter is B&B base.
 
Feasible solution      395.416980632 after      20019 iter,        63 nodes (gap 0.0%)
Improved solution      395.417083868 after      20126 iter,        75 nodes (gap 0.0%)
Improved solution      395.417187104 after      20212 iter,        87 nodes (gap 0.0%)
Improved solution      395.417225815 after      20379 iter,       128 nodes (gap 0.0%)
Improved solution      395.417303242 after      20640 iter,       170 nodes (gap 0.0%)
Improved solution      395.417341952 after      20959 iter,       237 nodes (gap 0.0%)
Improved solution      395.417354854 after      22274 iter,       706 nodes (gap 0.0%)
Improved solution      395.417354855 after      23210 iter,       972 nodes (gap 0.0%)
Improved solution      395.417367764 after      67004 iter,     18521 nodes (gap 0.0%)
Improved solution      395.417445188 after      67262 iter,     18565 nodes (gap 0.0%)
Improved solution      395.417458086 after      68993 iter,     19166 nodes (gap 0.0%)
Improved solution      395.417496798 after      71007 iter,     19761 nodes (gap 0.0%)
Improved solution      395.423109669 after      73151 iter,     20445 nodes (gap 0.0%)
Improved solution      395.423212905 after      73229 iter,     20457 nodes (gap 0.0%)
Improved solution      395.423316137 after      73355 iter,     20475 nodes (gap 0.0%)
Improved solution      395.423354846 after      73570 iter,     20532 nodes (gap 0.0%)
Improved solution      395.423432276 after      73724 iter,     20556 nodes (gap 0.0%)
Improved solution        395.4235097 after      74087 iter,     20612 nodes (gap 0.0%)
Improved solution      395.423535507 after      77624 iter,     22072 nodes (gap 0.0%)
Improved solution      395.423548406 after      78644 iter,     22452 nodes (gap 0.0%)
Improved solution      395.423574218 after      88240 iter,     26562 nodes (gap 0.0%)
Improved solution      395.423600025 after      91272 iter,     27772 nodes (gap 0.0%)
Improved solution      395.423612926 after      95747 iter,     29010 nodes (gap 0.0%)
Improved solution      395.426941913 after      96711 iter,     29190 nodes (gap 0.0%)
Improved solution      395.427045149 after      96805 iter,     29202 nodes (gap 0.0%)
Improved solution      395.427148385 after      96909 iter,     29214 nodes (gap 0.0%)
Improved solution      395.427187094 after      97112 iter,     29259 nodes (gap 0.0%)
Improved solution      395.427264524 after      97227 iter,     29277 nodes (gap 0.0%)
Improved solution      395.427341948 after      97536 iter,     29321 nodes (gap 0.0%)
Improved solution      395.427419369 after      98040 iter,     29409 nodes (gap 0.0%)
Improved solution      395.427432281 after      99656 iter,     29872 nodes (gap 0.0%)
Improved solution      395.427509702 after     100335 iter,     29962 nodes (gap 0.0%)
Improved solution      395.427522601 after     101162 iter,     30199 nodes (gap 0.0%)
Improved solution      395.427587121 after     105933 iter,     31796 nodes (gap 0.0%)
Improved solution      395.427612927 after     131165 iter,     41341 nodes (gap 0.0%)
Improved solution      395.427612928 after     136728 iter,     43464 nodes (gap 0.0%)
Improved solution      395.427625826 after     159840 iter,     51660 nodes (gap 0.0%)
Improved solution      395.427625828 after     166022 iter,     53967 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       395.427625828 after     226902 iter,     75665 nodes (gap 0.0%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 226902, 22036 (9.7%) were bound flips.
      There were 37893 refactorizations, 0 triggered by time and 0 by density.
       ... on average 5.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57855 NZ entries, 1.0x largest basis.
      The maximum B&B level was 88, 0.0x MIP order, 55 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.294 seconds, presolve used 0.179 seconds,
       ... 7199.855 seconds in simplex solver, in total 7200.328 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             2 iter.

Relaxed solution                   0 after       9294 iter is B&B base.
 
Feasible solution                  0 after       9294 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       9294 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 9294, 0 (0.0%) were bound flips.
      There were 39 refactorizations, 0 triggered by time and 0 by density.
       ... on average 238.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 39176 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.319 seconds, presolve used 0.195 seconds,
       ... 235.735 seconds in simplex solver, in total 236.249 seconds.
Vehicle Type: 0 Num:49 Trip segments:184