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

Relaxed solution       23.2179931459 after       8188 iter is B&B base.
 
Feasible solution        23.21203236 after       8413 iter,        27 nodes (gap 0.0%)
Improved solution       23.212032362 after       8466 iter,        51 nodes (gap 0.0%)
Improved solution       23.212045261 after       8519 iter,        70 nodes (gap 0.0%)
Improved solution       23.212058163 after      11222 iter,       992 nodes (gap 0.0%)
Improved solution       23.212071064 after      11632 iter,      1117 nodes (gap 0.0%)
Improved solution       23.212083966 after      13266 iter,      1652 nodes (gap 0.0%)
Improved solution       23.212096867 after      13368 iter,      1685 nodes (gap 0.0%)
Improved solution       23.212109767 after      16503 iter,      2683 nodes (gap 0.0%)
Improved solution       23.212942042 after      16790 iter,      2769 nodes (gap 0.0%)
Improved solution       23.212993652 after      16803 iter,      2775 nodes (gap 0.0%)
Improved solution        23.21303236 after      16821 iter,      2785 nodes (gap 0.0%)
Improved solution        23.21304526 after      17006 iter,      2841 nodes (gap 0.0%)
Improved solution       23.213058163 after      17035 iter,      2852 nodes (gap 0.0%)
Improved solution       23.213071064 after      17235 iter,      2917 nodes (gap 0.0%)
Improved solution       23.213071065 after      18176 iter,      3253 nodes (gap 0.0%)
Improved solution       23.213096868 after      18252 iter,      3274 nodes (gap 0.0%)
Improved solution       23.213109769 after      18353 iter,      3305 nodes (gap 0.0%)
Improved solution       23.213122669 after      19269 iter,      3622 nodes (gap 0.0%)
Improved solution       23.213122671 after      19365 iter,      3649 nodes (gap 0.0%)
Improved solution       23.213135572 after      19493 iter,      3682 nodes (gap 0.0%)
Improved solution       23.213942042 after      21627 iter,      4265 nodes (gap 0.0%)
Improved solution       23.213993652 after      21659 iter,      4272 nodes (gap 0.0%)
Improved solution       23.214019457 after      21713 iter,      4287 nodes (gap 0.0%)
Improved solution        23.21404526 after      22031 iter,      4354 nodes (gap 0.0%)
Improved solution       23.214058161 after      22477 iter,      4481 nodes (gap 0.0%)
Improved solution       23.214071063 after      24408 iter,      5033 nodes (gap 0.0%)
Improved solution       23.214083964 after      24543 iter,      5072 nodes (gap 0.0%)
Improved solution       23.214083966 after      26497 iter,      5575 nodes (gap 0.0%)
Improved solution       23.215083969 after      27387 iter,      5786 nodes (gap 0.0%)
Improved solution        23.21509687 after      27401 iter,      5791 nodes (gap 0.0%)
Improved solution        23.21510977 after      27516 iter,      5823 nodes (gap 0.0%)
Improved solution       23.215109771 after      28343 iter,      6040 nodes (gap 0.0%)
Improved solution       23.215109772 after      29161 iter,      6284 nodes (gap 0.0%)
Improved solution       23.215135577 after      29176 iter,      6289 nodes (gap 0.0%)
Improved solution       23.215135579 after      29261 iter,      6317 nodes (gap 0.0%)
Improved solution       23.215148479 after      29483 iter,      6371 nodes (gap 0.0%)
Improved solution       23.215187185 after      31060 iter,      6863 nodes (gap 0.0%)
Improved solution       23.215200084 after      76851 iter,     18118 nodes (gap 0.0%)
Improved solution       23.215225887 after      82117 iter,     19517 nodes (gap 0.0%)
 
Optimal solution        23.215225887 after     382146 iter,     90676 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 8.22909e-17

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 382146, 41716 (10.9%) were bound flips.
      There were 45373 refactorizations, 0 triggered by time and 0 by density.
       ... on average 7.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 21962 NZ entries, 1.0x largest basis.
      The maximum B&B level was 52, 0.0x MIP order, 33 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.177 seconds, presolve used 0.075 seconds,
       ... 3243.759 seconds in simplex solver, in total 3244.011 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             2 iter.

Relaxed solution                   0 after       3376 iter is B&B base.
 
Feasible solution                  0 after       3376 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3376 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 3376, 0 (0.0%) were bound flips.
      There were 15 refactorizations, 0 triggered by time and 0 by density.
       ... on average 225.1 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14150 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 128, with a dynamic range of 128000.
      Time to load data was 0.167 seconds, presolve used 0.073 seconds,
       ... 31.583 seconds in simplex solver, in total 31.823 seconds.
Vehicle Type: 0 Num:24 Trip segments:60