Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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          7688 iter.

Relaxed solution       395.743899003 after       8586 iter is B&B base.
 
Feasible solution      395.735077622 after       8912 iter,        53 nodes (gap 0.0%)
Improved solution      395.735129232 after       8971 iter,        69 nodes (gap 0.0%)
Improved solution      395.735180842 after       9030 iter,        85 nodes (gap 0.0%)
Improved solution      395.735232452 after       9089 iter,       101 nodes (gap 0.0%)
Improved solution      395.735284062 after       9148 iter,       117 nodes (gap 0.0%)
Improved solution      395.735309865 after       9482 iter,       292 nodes (gap 0.0%)
Improved solution      395.735335668 after      10006 iter,       531 nodes (gap 0.0%)
Improved solution      395.735348574 after      10842 iter,       862 nodes (gap 0.0%)
Improved solution      395.735361474 after      11956 iter,      1310 nodes (gap 0.0%)
Improved solution      395.742296966 after      12544 iter,      1615 nodes (gap 0.0%)
Improved solution      395.742322769 after      12562 iter,      1623 nodes (gap 0.0%)
Improved solution      395.742348572 after      12571 iter,      1627 nodes (gap 0.0%)
Improved solution      395.742361478 after      12888 iter,      1714 nodes (gap 0.0%)
Improved solution      395.742374378 after      13459 iter,      1872 nodes (gap 0.0%)
Improved solution      395.742387279 after      13567 iter,      1913 nodes (gap 0.0%)
Improved solution      395.742387281 after      13665 iter,      1942 nodes (gap 0.0%)
Improved solution      395.742400185 after      13710 iter,      1955 nodes (gap 0.0%)
Improved solution      395.742413085 after      13941 iter,      2033 nodes (gap 0.0%)
Improved solution      395.742425986 after      13997 iter,      2052 nodes (gap 0.0%)
Improved solution      395.742425988 after      14063 iter,      2072 nodes (gap 0.0%)
Improved solution      395.742438888 after      14203 iter,      2123 nodes (gap 0.0%)
Improved solution      395.742477594 after      14979 iter,      2362 nodes (gap 0.0%)
Improved solution      395.742503399 after      16035 iter,      2736 nodes (gap 0.0%)
Improved solution      395.742516299 after      16973 iter,      3075 nodes (gap 0.0%)
Improved solution      395.742529202 after      17593 iter,      3290 nodes (gap 0.0%)
Improved solution      395.742555005 after      17820 iter,      3373 nodes (gap 0.0%)
Improved solution      395.742580808 after      18583 iter,      3627 nodes (gap 0.0%)
Improved solution      395.742606611 after      21224 iter,      4557 nodes (gap 0.0%)
Improved solution      395.742632414 after      27274 iter,      6616 nodes (gap 0.0%)
Improved solution       395.74268402 after      29957 iter,      7484 nodes (gap 0.0%)
 
Optimal solution        395.74268402 after      30061 iter,      7520 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 30061, 3213 (10.7%) were bound flips.
      There were 3797 refactorizations, 0 triggered by time and 0 by density.
       ... on average 7.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22003 NZ entries, 1.0x largest basis.
      The maximum B&B level was 64, 0.0x MIP order, 43 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.177 seconds, presolve used 0.081 seconds,
       ... 259.526 seconds in simplex solver, in total 259.784 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     7646 constraints,   11381 variables,        32033 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       3376 iter is B&B base.
 
Feasible solution                  0 after       3376 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3376 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 3376, 0 (0.0%) were bound flips.
      There were 15 refactorizations, 0 triggered by time and 0 by density.
       ... on average 225.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14150 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.174 seconds, presolve used 0.071 seconds,
       ... 31.800 seconds in simplex solver, in total 32.045 seconds.
Vehicle Type: 0 Num:42 Trip segments:102