Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3242 constraints,    5231 variables,        13493 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          5190 iter.

Relaxed solution        383.97645416 after       6931 iter is B&B base.
 
Feasible solution      383.715662266 after       9115 iter,       104 nodes (gap 0.1%)
Improved solution      383.715662268 after       9229 iter,       122 nodes (gap 0.1%)
Improved solution      383.715665928 after       9266 iter,       128 nodes (gap 0.1%)
Improved solution       383.71566593 after       9285 iter,       130 nodes (gap 0.1%)
Improved solution      383.715669592 after       9329 iter,       140 nodes (gap 0.1%)
Improved solution      383.715669594 after       9443 iter,       158 nodes (gap 0.1%)
Improved solution       383.71567325 after       9600 iter,       186 nodes (gap 0.1%)
Improved solution      383.715676902 after      15975 iter,      2076 nodes (gap 0.1%)
Improved solution      383.715676906 after      20610 iter,      3432 nodes (gap 0.1%)
Improved solution      383.715680556 after      29342 iter,      5612 nodes (gap 0.1%)
Improved solution      383.715684202 after     331477 iter,     82743 nodes (gap 0.1%)
Improved solution       383.71667325 after     426618 iter,    105381 nodes (gap 0.1%)
Improved solution        383.7166769 after     429638 iter,    105955 nodes (gap 0.1%)
Improved solution      383.717665926 after     442729 iter,    109379 nodes (gap 0.1%)
Improved solution      383.717669586 after     443318 iter,    109464 nodes (gap 0.1%)
Improved solution      383.717673236 after     446143 iter,    109988 nodes (gap 0.1%)
Improved solution       383.71767325 after     473605 iter,    115971 nodes (gap 0.1%)
Improved solution        383.7176769 after     481784 iter,    117373 nodes (gap 0.1%)
Improved solution      383.717680546 after     879382 iter,    197692 nodes (gap 0.1%)
Improved solution       383.72066226 after     896496 iter,    201336 nodes (gap 0.1%)
Improved solution      383.720665924 after     896566 iter,    201348 nodes (gap 0.1%)
Improved solution      383.720669586 after     896624 iter,    201360 nodes (gap 0.1%)
Improved solution      383.720669588 after     900027 iter,    201960 nodes (gap 0.1%)
Improved solution      383.720673244 after     902952 iter,    202419 nodes (gap 0.1%)
Improved solution      383.720676896 after     932242 iter,    207529 nodes (gap 0.1%)
Improved solution        383.7206769 after     951944 iter,    211787 nodes (gap 0.1%)
Improved solution       383.72068055 after     987079 iter,    217748 nodes (gap 0.1%)
Improved solution      383.720680556 after    1056319 iter,    228347 nodes (gap 0.1%)
Improved solution       383.72068056 after    1135655 iter,    239027 nodes (gap 0.1%)
Improved solution       383.72068421 after    1204484 iter,    248527 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        383.72068421 after    2563627 iter,    435582 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 2563627, 210068 (8.2%) were bound flips.
      There were 217785 refactorizations, 0 triggered by time and 13 by density.
       ... on average 10.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10430 NZ entries, 1.1x largest basis.
      The maximum B&B level was 125, 0.1x MIP order, 102 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.051 seconds, presolve used 0.029 seconds,
       ... 7199.981 seconds in simplex solver, in total 7200.061 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3242 constraints,    5231 variables,        13493 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           283 iter.

Relaxed solution                   0 after       1749 iter is B&B base.
 
Feasible solution                  0 after       1749 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1749 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 1749, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 0 by density.
       ... on average 194.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6661 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.054 seconds, presolve used 0.030 seconds,
       ... 4.951 seconds in simplex solver, in total 5.035 seconds.
Vehicle Type: 0 Num:51 Trip segments:348