Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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          4234 iter.

Relaxed solution       378.439888921 after       4630 iter is B&B base.
 
Feasible solution      377.809528901 after       5847 iter,        54 nodes (gap 0.2%)
Improved solution      377.813528903 after       5913 iter,        60 nodes (gap 0.2%)
Improved solution      377.818503086 after       6318 iter,        84 nodes (gap 0.2%)
Improved solution      377.818554718 after       6515 iter,        99 nodes (gap 0.2%)
Improved solution       377.81860635 after       7325 iter,       146 nodes (gap 0.2%)
Improved solution       377.81865798 after       8108 iter,       196 nodes (gap 0.2%)
Improved solution      377.818709606 after      27040 iter,      1522 nodes (gap 0.2%)
Improved solution      377.818735419 after     182155 iter,     11629 nodes (gap 0.2%)
Improved solution      377.819554722 after     886989 iter,     59720 nodes (gap 0.2%)
Improved solution      377.819606354 after     887007 iter,     59723 nodes (gap 0.2%)
Improved solution      377.820503086 after     887241 iter,     59737 nodes (gap 0.2%)
Improved solution      377.820554718 after     887250 iter,     59739 nodes (gap 0.2%)
Improved solution      377.820580535 after     887764 iter,     59775 nodes (gap 0.2%)
Improved solution      377.820632163 after     890093 iter,     59938 nodes (gap 0.2%)
Improved solution       377.82065798 after     895810 iter,     60311 nodes (gap 0.2%)
Improved solution      377.820683789 after     908133 iter,     61179 nodes (gap 0.2%)
Improved solution      377.820709606 after     911574 iter,     61403 nodes (gap 0.2%)
Improved solution      377.820735419 after    1092178 iter,     74224 nodes (gap 0.2%)
Improved solution      377.820761228 after    1679881 iter,    118641 nodes (gap 0.2%)
Improved solution      377.821528903 after    2369247 iter,    166748 nodes (gap 0.2%)
Improved solution      377.821580535 after    2369272 iter,    166751 nodes (gap 0.2%)
Improved solution      377.821580537 after    2369671 iter,    166779 nodes (gap 0.2%)
Improved solution      377.822503082 after    2369977 iter,    166798 nodes (gap 0.2%)
Improved solution      377.822554714 after    2369985 iter,    166801 nodes (gap 0.2%)
Improved solution      377.822606346 after    2370183 iter,    166817 nodes (gap 0.2%)
Improved solution      377.822632157 after    2371196 iter,    166901 nodes (gap 0.2%)
Improved solution      377.822657976 after    2376257 iter,    167214 nodes (gap 0.2%)
Improved solution      377.822709602 after    2394526 iter,    168536 nodes (gap 0.2%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       377.822709602 after    2399468 iter,    168813 nodes (gap 0.2%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2399468, 129854 (5.4%) were bound flips.
      There were 84433 refactorizations, 0 triggered by time and 7 by density.
       ... on average 26.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10194 NZ entries, 1.0x largest basis.
      The maximum B&B level was 73, 0.1x MIP order, 61 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.097 seconds, presolve used 0.049 seconds,
       ... 7199.956 seconds in simplex solver, in total 7200.102 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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       1558 iter is B&B base.
 
Feasible solution                  0 after       1558 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1558 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 1558, 0 (0.0%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 0 by density.
       ... on average 194.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.060 seconds, presolve used 0.034 seconds,
       ... 5.718 seconds in simplex solver, in total 5.812 seconds.
Vehicle Type: 0 Num:26 Trip segments:100