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

Relaxed solution       402.001271552 after       4800 iter is B&B base.
 
Feasible solution      375.880802554 after       5650 iter,        86 nodes (gap 6.5%)
Improved solution       384.90580255 after       5673 iter,        89 nodes (gap 4.2%)
Improved solution       384.90582861 after       5731 iter,       103 nodes (gap 4.2%)
Improved solution       395.91680255 after       5784 iter,       118 nodes (gap 1.5%)
Improved solution       395.91682861 after       5843 iter,       132 nodes (gap 1.5%)
Improved solution      395.916854668 after       6780 iter,       343 nodes (gap 1.5%)
Improved solution      395.916880722 after       8633 iter,       801 nodes (gap 1.5%)
Improved solution      395.916880726 after      40613 iter,      9395 nodes (gap 1.5%)
Improved solution      395.916906776 after      43302 iter,     10095 nodes (gap 1.5%)
Improved solution       395.92280255 after      93463 iter,     24452 nodes (gap 1.5%)
Improved solution       395.92282861 after      93519 iter,     24466 nodes (gap 1.5%)
Improved solution      395.922854668 after      95009 iter,     24775 nodes (gap 1.5%)
Improved solution      395.922880722 after      97582 iter,     25341 nodes (gap 1.5%)
Improved solution      395.922880726 after     134734 iter,     34103 nodes (gap 1.5%)
Improved solution      395.922906776 after     138345 iter,     34977 nodes (gap 1.5%)
Improved solution       395.92290678 after     436537 iter,    110363 nodes (gap 1.5%)
Improved solution       395.92293283 after     437529 iter,    110633 nodes (gap 1.5%)
Improved solution       395.93180255 after     618988 iter,    158794 nodes (gap 1.5%)
Improved solution       395.93182861 after     619028 iter,    158804 nodes (gap 1.5%)
Improved solution      395.931854668 after     620199 iter,    159045 nodes (gap 1.5%)
Improved solution      395.931880722 after     622589 iter,    159595 nodes (gap 1.5%)
Improved solution      395.931880726 after     653622 iter,    167667 nodes (gap 1.5%)
Improved solution      395.931906776 after     656394 iter,    168367 nodes (gap 1.5%)
Improved solution       395.93780255 after     705684 iter,    182174 nodes (gap 1.5%)
Improved solution       395.93782861 after     705742 iter,    182188 nodes (gap 1.5%)
Improved solution      395.937854668 after     706828 iter,    182413 nodes (gap 1.5%)
Improved solution      395.937880722 after     708710 iter,    182827 nodes (gap 1.5%)
Improved solution      395.937880726 after     745984 iter,    192069 nodes (gap 1.5%)
Improved solution      395.937906776 after     749464 iter,    192943 nodes (gap 1.5%)
Improved solution       395.93790678 after    1039394 iter,    269937 nodes (gap 1.5%)
Improved solution       395.93793283 after    1040392 iter,    270207 nodes (gap 1.5%)
Improved solution      395.937958874 after    1881107 iter,    504957 nodes (gap 1.5%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       395.937958874 after    2165538 iter,    588191 nodes (gap 1.5%).

Excellent numeric accuracy ||*|| = 1.15463e-14

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 2165538, 155972 (7.2%) were bound flips.
      There were 294084 refactorizations, 0 triggered by time and 5 by density.
       ... on average 6.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 9804 NZ entries, 1.1x largest basis.
      The maximum B&B level was 101, 0.1x MIP order, 86 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.046 seconds, presolve used 0.031 seconds,
       ... 7199.973 seconds in simplex solver, in total 7200.050 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             2 iter.

Relaxed solution                   0 after       1468 iter is B&B base.
 
Feasible solution                  0 after       1468 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1468 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 1468, 0 (0.0%) were bound flips.
      There were 7 refactorizations, 0 triggered by time and 0 by density.
       ... on average 209.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 5745 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.077 seconds, presolve used 0.028 seconds,
       ... 4.186 seconds in simplex solver, in total 4.291 seconds.
Vehicle Type: 0 Num:25 Trip segments:160