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

Relaxed solution       396.627850847 after      20342 iter is B&B base.
 
Feasible solution      396.222959376 after      20997 iter,        45 nodes (gap 0.1%)
Improved solution       396.24195937 after      21007 iter,        47 nodes (gap 0.1%)
Improved solution      396.241985402 after      22934 iter,       263 nodes (gap 0.1%)
Improved solution      396.241991902 after      24719 iter,       463 nodes (gap 0.1%)
Improved solution      396.242985406 after      58999 iter,      4962 nodes (gap 0.1%)
Improved solution      396.242991902 after      61807 iter,      5381 nodes (gap 0.1%)
Improved solution      396.242991903 after      61835 iter,      5386 nodes (gap 0.1%)
Improved solution      396.246939849 after      82066 iter,      8422 nodes (gap 0.1%)
Improved solution      396.246965877 after      82355 iter,      8440 nodes (gap 0.1%)
Improved solution      396.246985406 after      82442 iter,      8449 nodes (gap 0.1%)
Improved solution      396.246991907 after      90735 iter,      9394 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       396.246991907 after     284763 iter,     35044 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 284763, 17079 (6.0%) were bound flips.
      There were 17587 refactorizations, 0 triggered by time and 1 by density.
       ... on average 15.2 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57900 NZ entries, 1.0x largest basis.
      The maximum B&B level was 77, 0.0x MIP order, 53 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.305 seconds, presolve used 0.213 seconds,
       ... 7199.816 seconds in simplex solver, in total 7200.334 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 ||*|| = 0

 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 64, with a dynamic range of 64000.
      Time to load data was 0.317 seconds, presolve used 0.209 seconds,
       ... 240.615 seconds in simplex solver, in total 241.141 seconds.
Vehicle Type: 0 Num:35 Trip segments:155