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

Relaxed solution       771.885703213 after      19904 iter is B&B base.
 
Feasible solution      771.884731989 after      20040 iter,        47 nodes (gap 0.0%)
Improved solution      771.884751494 after      20082 iter,        64 nodes (gap 0.0%)
Improved solution      771.884784013 after      20119 iter,        79 nodes (gap 0.0%)
Improved solution      771.884784016 after      20192 iter,       110 nodes (gap 0.0%)
Improved solution      771.884790513 after      20365 iter,       182 nodes (gap 0.0%)
Improved solution      771.884790515 after      20439 iter,       215 nodes (gap 0.0%)
Improved solution      771.884823028 after      20645 iter,       309 nodes (gap 0.0%)
Improved solution       771.88482303 after      20829 iter,       389 nodes (gap 0.0%)
Improved solution      771.884829528 after      21396 iter,       682 nodes (gap 0.0%)
Improved solution      771.884829529 after      21749 iter,       862 nodes (gap 0.0%)
Improved solution      771.884836037 after      23132 iter,      1460 nodes (gap 0.0%)
Improved solution       771.88483604 after      23154 iter,      1467 nodes (gap 0.0%)
Improved solution      771.884842537 after      23583 iter,      1637 nodes (gap 0.0%)
Improved solution      771.884842539 after      23606 iter,      1644 nodes (gap 0.0%)
Improved solution      771.884875052 after      23935 iter,      1782 nodes (gap 0.0%)
Improved solution      771.884875054 after      24098 iter,      1867 nodes (gap 0.0%)
Improved solution      771.884881552 after      26056 iter,      2887 nodes (gap 0.0%)
Improved solution      771.884881553 after      26218 iter,      2980 nodes (gap 0.0%)
Improved solution      771.884888061 after      33162 iter,      6608 nodes (gap 0.0%)
Improved solution      771.884888062 after      33312 iter,      6691 nodes (gap 0.0%)
Improved solution      771.884888064 after      33870 iter,      6966 nodes (gap 0.0%)
Improved solution      771.884894564 after      33893 iter,      6973 nodes (gap 0.0%)
Improved solution      771.884901063 after      37346 iter,      8772 nodes (gap 0.0%)
Improved solution      771.884907567 after      43387 iter,     11895 nodes (gap 0.0%)
Improved solution      771.884927076 after      43620 iter,     11998 nodes (gap 0.0%)
Improved solution      771.884933576 after      43975 iter,     12227 nodes (gap 0.0%)
Improved solution      771.884940075 after      53619 iter,     17618 nodes (gap 0.0%)
Improved solution      771.884972588 after      59582 iter,     20741 nodes (gap 0.0%)
Improved solution      771.884998594 after      66232 iter,     24690 nodes (gap 0.0%)
 
Optimal solution       771.884998594 after      66298 iter,     24726 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 1.6185e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 66298, 11722 (17.7%) were bound flips.
      There were 12445 refactorizations, 0 triggered by time and 0 by density.
       ... on average 4.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57754 NZ entries, 1.0x largest basis.
      The maximum B&B level was 57, 0.0x MIP order, 50 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.299 seconds, presolve used 0.189 seconds,
       ... 2115.086 seconds in simplex solver, in total 2115.574 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.338 seconds, presolve used 0.190 seconds,
       ... 229.068 seconds in simplex solver, in total 229.596 seconds.
Vehicle Type: 0 Num:42 Trip segments:154