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

Relaxed solution       465.488696819 after       6915 iter is B&B base.
 
Feasible solution      443.403825628 after       8618 iter,        66 nodes (gap 4.7%)
Improved solution      448.394825626 after      14302 iter,       271 nodes (gap 3.7%)
Improved solution      448.418825626 after      15916 iter,       375 nodes (gap 3.7%)
Improved solution      448.426825628 after      15960 iter,       376 nodes (gap 3.7%)
Improved solution      449.368825626 after      17681 iter,       463 nodes (gap 3.5%)
Improved solution      457.335821962 after      20819 iter,       616 nodes (gap 1.7%)
Improved solution      457.401821966 after      21473 iter,       645 nodes (gap 1.7%)
Improved solution      460.317818304 after      90033 iter,      3659 nodes (gap 1.1%)
Improved solution      460.328818304 after      95414 iter,      3951 nodes (gap 1.1%)
Improved solution      460.333818304 after    2974171 iter,    196177 nodes (gap 1.1%)
Improved solution      463.202814636 after    2985569 iter,    196826 nodes (gap 0.5%)
Improved solution      463.239814636 after    2985930 iter,    196895 nodes (gap 0.5%)
Improved solution      463.263814636 after    3004857 iter,    198646 nodes (gap 0.5%)
Improved solution       463.26481463 after    3097370 iter,    207211 nodes (gap 0.5%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        463.26481463 after    3117351 iter,    209200 nodes (gap 0.5%).

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 3117351, 128380 (4.1%) were bound flips.
      There were 104881 refactorizations, 0 triggered by time and 57 by density.
       ... on average 28.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10421 NZ entries, 1.1x largest basis.
      The maximum B&B level was 89, 0.1x MIP order, 64 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.052 seconds, presolve used 0.028 seconds,
       ... 7199.976 seconds in simplex solver, in total 7200.056 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 6674 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.035 seconds,
       ... 4.965 seconds in simplex solver, in total 5.054 seconds.
Vehicle Type: 0 Num:26 Trip segments:204