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

Relaxed solution       23.2859837407 after       4142 iter is B&B base.
 
Feasible solution       20.221048118 after       5174 iter,       135 nodes (gap 12.6%)
Improved solution       20.221074164 after       5276 iter,       161 nodes (gap 12.6%)
Improved solution       20.221074166 after       5419 iter,       201 nodes (gap 12.6%)
Improved solution       20.221100212 after       5455 iter,       209 nodes (gap 12.6%)
Improved solution       20.221126258 after       7248 iter,       751 nodes (gap 12.6%)
Improved solution         20.2211523 after      10962 iter,      1783 nodes (gap 12.6%)
Improved solution       20.221152304 after      11362 iter,      1913 nodes (gap 12.6%)
Improved solution       20.221178346 after      11936 iter,      2103 nodes (gap 12.6%)
Improved solution       20.221178348 after      13135 iter,      2485 nodes (gap 12.6%)
Improved solution        20.22120439 after      13702 iter,      2675 nodes (gap 12.6%)
Improved solution       20.221230428 after      15609 iter,      3341 nodes (gap 12.6%)
Improved solution       20.221230434 after      16471 iter,      3645 nodes (gap 12.6%)
Improved solution       20.221256472 after      17751 iter,      4101 nodes (gap 12.6%)
Improved solution       20.221256474 after      19905 iter,      4763 nodes (gap 12.6%)
Improved solution       20.221282512 after      21314 iter,      5257 nodes (gap 12.6%)
Improved solution       20.221282516 after      23213 iter,      5681 nodes (gap 12.6%)
Improved solution       20.221308554 after      27643 iter,      6963 nodes (gap 12.6%)
Improved solution       20.221308558 after      30042 iter,      7495 nodes (gap 12.6%)
Improved solution       20.221334596 after      34433 iter,      8777 nodes (gap 12.6%)
Improved solution       23.227943882 after      34890 iter,      8813 nodes (gap 0.2%)
Improved solution        23.22796994 after      34929 iter,      8821 nodes (gap 0.2%)
Improved solution       23.228943882 after      35106 iter,      8837 nodes (gap 0.2%)
Improved solution        23.22896994 after      35174 iter,      8848 nodes (gap 0.2%)
Improved solution       23.228995996 after      35575 iter,      8895 nodes (gap 0.2%)
Improved solution       23.228995998 after      36008 iter,      8951 nodes (gap 0.2%)
Improved solution       23.229022052 after      36174 iter,      8973 nodes (gap 0.2%)
Improved solution       23.229048104 after      38453 iter,      9373 nodes (gap 0.2%)
Improved solution       23.229048106 after      39641 iter,      9583 nodes (gap 0.2%)
Improved solution       23.229074154 after      41215 iter,      9897 nodes (gap 0.2%)
Improved solution         23.2291002 after      49874 iter,     11753 nodes (gap 0.2%)
Improved solution       23.229100202 after      57391 iter,     13409 nodes (gap 0.2%)
Improved solution       23.229126248 after      71378 iter,     16677 nodes (gap 0.2%)
Improved solution       23.229152294 after     126458 iter,     29808 nodes (gap 0.2%)
Improved solution       23.229178336 after     249238 iter,     60634 nodes (gap 0.2%)
Improved solution       23.229178338 after     312513 iter,     77970 nodes (gap 0.2%)
Improved solution        23.22920438 after     495398 iter,    126328 nodes (gap 0.2%)
Improved solution       23.229204382 after     573738 iter,    147992 nodes (gap 0.2%)
Improved solution       23.229230422 after     752004 iter,    198352 nodes (gap 0.2%)
Improved solution       23.229256462 after    1494235 iter,    402108 nodes (gap 0.2%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        23.229256462 after    1887894 iter,    504113 nodes (gap 0.2%).

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 1887894, 128063 (6.8%) were bound flips.
      There were 252021 refactorizations, 0 triggered by time and 5 by density.
       ... on average 7.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 8988 NZ entries, 1.0x largest basis.
      The maximum B&B level was 150, 0.2x MIP order, 139 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.050 seconds, presolve used 0.029 seconds,
       ... 7199.976 seconds in simplex solver, in total 7200.055 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.140 seconds, presolve used 0.046 seconds,
       ... 7.949 seconds in simplex solver, in total 8.135 seconds.
Vehicle Type: 0 Num:52 Trip segments:268