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

Relaxed solution       24.2299922225 after       8346 iter is B&B base.
 
Feasible solution        24.22990802 after       8641 iter,        41 nodes (gap 0.0%)
Improved solution       24.229909823 after       8656 iter,        47 nodes (gap 0.0%)
Improved solution       24.229911626 after       8860 iter,        92 nodes (gap 0.0%)
Improved solution       24.229912529 after       8967 iter,       122 nodes (gap 0.0%)
Improved solution       24.229912532 after       9117 iter,       155 nodes (gap 0.0%)
Improved solution       24.229914335 after       9552 iter,       258 nodes (gap 0.0%)
Improved solution       24.229915238 after       9699 iter,       302 nodes (gap 0.0%)
Improved solution       24.229916138 after      11206 iter,       663 nodes (gap 0.0%)
Improved solution       24.229917941 after      12799 iter,      1052 nodes (gap 0.0%)
Improved solution       24.229918844 after      12943 iter,      1096 nodes (gap 0.0%)
Improved solution       24.229918847 after      19884 iter,      2609 nodes (gap 0.0%)
Improved solution        24.22991975 after      20112 iter,      2677 nodes (gap 0.0%)
Improved solution        24.22992065 after      21891 iter,      3096 nodes (gap 0.0%)
Improved solution        24.22992155 after      58668 iter,     11161 nodes (gap 0.0%)
Improved solution       24.229922453 after      59147 iter,     11293 nodes (gap 0.0%)
Improved solution       24.229922456 after      95819 iter,     19527 nodes (gap 0.0%)
Improved solution       24.229923359 after      96986 iter,     19887 nodes (gap 0.0%)
Improved solution       24.229924259 after     102567 iter,     21244 nodes (gap 0.0%)
Improved solution       24.229925159 after     189303 iter,     40721 nodes (gap 0.0%)
Improved solution       24.229926062 after     189999 iter,     40917 nodes (gap 0.0%)
Improved solution       24.229926965 after     254548 iter,     55863 nodes (gap 0.0%)
Improved solution       24.229927865 after     261407 iter,     57516 nodes (gap 0.0%)
Improved solution       24.229928768 after     431690 iter,     97806 nodes (gap 0.0%)
Improved solution       24.229929668 after     466059 iter,    106227 nodes (gap 0.0%)
Improved solution       24.229930571 after     467726 iter,    106723 nodes (gap 0.0%)
Improved solution       24.229931471 after     653666 iter,    149806 nodes (gap 0.0%)
Improved solution       24.229932374 after     655208 iter,    150302 nodes (gap 0.0%)
Improved solution       24.229933277 after     806836 iter,    187354 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        24.229933277 after     849587 iter,    197557 nodes (gap 0.0%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 849587, 76689 (9.0%) were bound flips.
      There were 98801 refactorizations, 0 triggered by time and 1 by density.
       ... on average 7.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22017 NZ entries, 1.0x largest basis.
      The maximum B&B level was 53, 0.0x MIP order, 40 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.199 seconds, presolve used 0.071 seconds,
       ... 7199.949 seconds in simplex solver, in total 7200.219 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           105 iter.

Relaxed solution                   0 after       3479 iter is B&B base.
 
Feasible solution                  0 after       3479 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3479 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 3479, 0 (0.0%) were bound flips.
      There were 16 refactorizations, 0 triggered by time and 0 by density.
       ... on average 217.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14574 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.167 seconds, presolve used 0.088 seconds,
       ... 32.517 seconds in simplex solver, in total 32.772 seconds.
Vehicle Type: 0 Num:33 Trip segments:74