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

Relaxed solution       775.073682708 after      31278 iter is B&B base.
 
Feasible solution      774.792610959 after      33255 iter,        95 nodes (gap 0.0%)
Improved solution       774.79261187 after      35212 iter,       268 nodes (gap 0.0%)
Improved solution      774.792618239 after      37888 iter,       469 nodes (gap 0.0%)
Improved solution       774.79261916 after      40496 iter,       696 nodes (gap 0.0%)
Improved solution      774.792620058 after      44253 iter,      1049 nodes (gap 0.0%)
Improved solution      774.792620075 after      47093 iter,      1425 nodes (gap 0.0%)
Improved solution      774.792622784 after      59277 iter,      2970 nodes (gap 0.0%)
Improved solution      774.792623705 after      60161 iter,      3097 nodes (gap 0.0%)
Improved solution      774.792624598 after     194880 iter,     20521 nodes (gap 0.0%)
Improved solution      774.792625519 after     195847 iter,     20648 nodes (gap 0.0%)
Improved solution      774.792626424 after     235565 iter,     26385 nodes (gap 0.0%)
Improved solution      774.792627328 after     249674 iter,     28026 nodes (gap 0.0%)
Improved solution      774.792628237 after     251307 iter,     28309 nodes (gap 0.0%)
Improved solution      774.792629153 after     263585 iter,     29730 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       774.792629153 after     303365 iter,     35402 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 303365, 14448 (4.8%) were bound flips.
      There were 17792 refactorizations, 0 triggered by time and 0 by density.
       ... on average 16.2 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 59645 NZ entries, 1.0x largest basis.
      The maximum B&B level was 134, 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.313 seconds, presolve used 0.184 seconds,
       ... 7199.865 seconds in simplex solver, in total 7200.362 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          2111 iter.

Relaxed solution                   0 after      11416 iter is B&B base.
 
Feasible solution                  0 after      11416 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after      11416 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 11416, 0 (0.0%) were bound flips.
      There were 48 refactorizations, 0 triggered by time and 0 by density.
       ... on average 237.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 48380 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.306 seconds, presolve used 0.185 seconds,
       ... 256.744 seconds in simplex solver, in total 257.235 seconds.
Vehicle Type: 0 Num:88 Trip segments:410