Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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          4575 iter.

Relaxed solution       375.384887635 after       5231 iter is B&B base.
 
Feasible solution      374.724258501 after       6339 iter,        54 nodes (gap 0.2%)
Improved solution      374.724258503 after       6780 iter,        78 nodes (gap 0.2%)
Improved solution      374.727245486 after       6821 iter,        82 nodes (gap 0.2%)
Improved solution      374.731284535 after       6954 iter,        89 nodes (gap 0.2%)
Improved solution      374.731310567 after       7572 iter,       122 nodes (gap 0.2%)
Improved solution       374.73132358 after      12768 iter,       438 nodes (gap 0.2%)
Improved solution      374.731336593 after      22310 iter,      1162 nodes (gap 0.2%)
Improved solution      374.731349606 after      28214 iter,      1548 nodes (gap 0.2%)
Improved solution      374.731375632 after     184907 iter,     11076 nodes (gap 0.2%)
Improved solution      374.734258501 after     555633 iter,     35678 nodes (gap 0.2%)
Improved solution      374.737297554 after     555754 iter,     35687 nodes (gap 0.2%)
Improved solution      374.738284535 after     555832 iter,     35694 nodes (gap 0.2%)
Improved solution      374.738297546 after     556583 iter,     35759 nodes (gap 0.2%)
Improved solution      374.738310561 after     556701 iter,     35771 nodes (gap 0.2%)
Improved solution      374.743297542 after     559319 iter,     35944 nodes (gap 0.2%)
Improved solution      374.743310559 after     559467 iter,     35960 nodes (gap 0.2%)
Improved solution      374.743310563 after     579054 iter,     37304 nodes (gap 0.2%)
Improved solution       374.74332357 after     580187 iter,     37396 nodes (gap 0.2%)
Improved solution      374.743323576 after     588236 iter,     37909 nodes (gap 0.2%)
Improved solution      374.743336589 after     589640 iter,     38002 nodes (gap 0.2%)
Improved solution      374.743362615 after     703206 iter,     45960 nodes (gap 0.2%)
Improved solution      374.743362619 after    1230528 iter,     82299 nodes (gap 0.2%)
Improved solution      374.743375632 after    1231675 iter,     82386 nodes (gap 0.2%)
Improved solution      374.745271522 after    1311276 iter,     88133 nodes (gap 0.2%)
Improved solution      374.745297554 after    1311287 iter,     88135 nodes (gap 0.2%)
Improved solution      374.746271518 after    1311394 iter,     88142 nodes (gap 0.2%)
Improved solution      374.746284535 after    1311403 iter,     88146 nodes (gap 0.2%)
Improved solution      374.746284539 after    1311828 iter,     88177 nodes (gap 0.2%)
Improved solution      374.751271518 after    1312845 iter,     88256 nodes (gap 0.2%)
Improved solution      374.751284535 after    1313248 iter,     88284 nodes (gap 0.2%)
Improved solution      374.751297544 after    1313858 iter,     88330 nodes (gap 0.2%)
Improved solution       374.75129755 after    1318198 iter,     88639 nodes (gap 0.2%)
Improved solution      374.751310563 after    1319705 iter,     88750 nodes (gap 0.2%)
Improved solution      374.751310567 after    1327302 iter,     89399 nodes (gap 0.2%)
Improved solution       374.75132357 after    1328987 iter,     89542 nodes (gap 0.2%)
Improved solution       374.75132358 after    1329868 iter,     89602 nodes (gap 0.2%)
Improved solution      374.751336593 after    1332607 iter,     89797 nodes (gap 0.2%)
Improved solution      374.751362619 after    1452791 iter,     99639 nodes (gap 0.2%)
Improved solution      374.751375632 after    1923618 iter,    137128 nodes (gap 0.2%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       374.751375632 after    2629950 iter,    185988 nodes (gap 0.2%).

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 2629950, 111776 (4.3%) were bound flips.
      There were 93043 refactorizations, 0 triggered by time and 8 by density.
       ... on average 27.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 10315 NZ entries, 1.0x largest basis.
      The maximum B&B level was 73, 0.1x MIP order, 58 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.058 seconds, presolve used 0.032 seconds,
       ... 7199.978 seconds in simplex solver, in total 7200.068 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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       1558 iter is B&B base.
 
Feasible solution                  0 after       1558 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1558 iter,         0 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 1558, 0 (0.0%) were bound flips.
      There were 8 refactorizations, 0 triggered by time and 0 by density.
       ... on average 194.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.108 seconds, presolve used 0.048 seconds,
       ... 12.393 seconds in simplex solver, in total 12.549 seconds.
Vehicle Type: 0 Num:26 Trip segments:96