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

Relaxed solution       373.547904245 after       8944 iter is B&B base.
 
Feasible solution      373.379206564 after       9539 iter,        50 nodes (gap 0.0%)
Improved solution      373.379219466 after       9567 iter,        56 nodes (gap 0.0%)
Improved solution      373.379245275 after       9663 iter,        75 nodes (gap 0.0%)
Improved solution      373.379258177 after       9712 iter,        85 nodes (gap 0.0%)
Improved solution      373.379258179 after       9952 iter,       127 nodes (gap 0.0%)
Improved solution      373.379271081 after       9990 iter,       137 nodes (gap 0.0%)
Improved solution      373.379283984 after      10543 iter,       229 nodes (gap 0.0%)
Improved solution      373.379296886 after      10604 iter,       239 nodes (gap 0.0%)
Improved solution       373.37929689 after      10832 iter,       268 nodes (gap 0.0%)
Improved solution      373.379309791 after      11354 iter,       345 nodes (gap 0.0%)
Improved solution      373.379309793 after      11406 iter,       353 nodes (gap 0.0%)
Improved solution      373.379322695 after      11453 iter,       363 nodes (gap 0.0%)
Improved solution      373.379335598 after      11677 iter,       402 nodes (gap 0.0%)
Improved solution        373.3793485 after      12089 iter,       470 nodes (gap 0.0%)
Improved solution      373.385206565 after      12641 iter,       577 nodes (gap 0.0%)
Improved solution      373.385219468 after      12754 iter,       601 nodes (gap 0.0%)
Improved solution       373.38523237 after      12805 iter,       611 nodes (gap 0.0%)
Improved solution      373.385245273 after      12838 iter,       618 nodes (gap 0.0%)
Improved solution      373.385258175 after      12877 iter,       628 nodes (gap 0.0%)
Improved solution      373.385258179 after      12946 iter,       642 nodes (gap 0.0%)
Improved solution      373.385271081 after      13054 iter,       660 nodes (gap 0.0%)
Improved solution      373.385283984 after      13108 iter,       669 nodes (gap 0.0%)
Improved solution      373.385296886 after      13142 iter,       679 nodes (gap 0.0%)
Improved solution       373.38529689 after      15366 iter,      1020 nodes (gap 0.0%)
Improved solution      373.385309793 after      17443 iter,      1323 nodes (gap 0.0%)
Improved solution      373.385322695 after      17549 iter,      1341 nodes (gap 0.0%)
Improved solution      373.385335596 after      18345 iter,      1472 nodes (gap 0.0%)
Improved solution      373.385335598 after      18389 iter,      1480 nodes (gap 0.0%)
Improved solution        373.3853485 after      18447 iter,      1490 nodes (gap 0.0%)
Improved solution      373.385361403 after      19707 iter,      1751 nodes (gap 0.0%)
Improved solution      373.385374305 after      19740 iter,      1761 nodes (gap 0.0%)
Improved solution      373.385374309 after      88530 iter,     12730 nodes (gap 0.0%)
Improved solution       373.38538721 after      89434 iter,     12869 nodes (gap 0.0%)
Improved solution      373.385387212 after      99191 iter,     14687 nodes (gap 0.0%)
Improved solution      373.385400114 after      99286 iter,     14705 nodes (gap 0.0%)
Improved solution      373.385413017 after     100924 iter,     15020 nodes (gap 0.0%)
Improved solution      373.385425919 after     101024 iter,     15038 nodes (gap 0.0%)
Improved solution      373.385438821 after     884867 iter,    134595 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       373.385438821 after     923381 iter,    140437 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 5.37764e-16

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 923381, 95921 (10.4%) were bound flips.
      There were 70236 refactorizations, 0 triggered by time and 0 by density.
       ... on average 11.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22014 NZ entries, 1.0x largest basis.
      The maximum B&B level was 67, 0.0x MIP order, 57 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.192 seconds, presolve used 0.082 seconds,
       ... 7199.927 seconds in simplex solver, in total 7200.201 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.165 seconds, presolve used 0.073 seconds,
       ... 30.612 seconds in simplex solver, in total 30.850 seconds.
Vehicle Type: 0 Num:48 Trip segments:121