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

Relaxed solution       378.581898004 after       9021 iter is B&B base.
 
Feasible solution      378.386109171 after       9437 iter,        51 nodes (gap 0.1%)
Improved solution      378.386122176 after       9615 iter,       100 nodes (gap 0.1%)
Improved solution      378.386141685 after       9890 iter,       171 nodes (gap 0.1%)
Improved solution      378.386148193 after      10275 iter,       268 nodes (gap 0.1%)
Improved solution      378.386154701 after      10548 iter,       340 nodes (gap 0.1%)
Improved solution      378.386167699 after      13566 iter,      1038 nodes (gap 0.1%)
Improved solution      378.386167706 after      14725 iter,      1293 nodes (gap 0.1%)
Improved solution      378.386180715 after      16011 iter,      1578 nodes (gap 0.1%)
Improved solution      378.388089656 after      18466 iter,      2107 nodes (gap 0.1%)
Improved solution      378.388102661 after      19486 iter,      2325 nodes (gap 0.1%)
Improved solution      378.388102665 after      20748 iter,      2586 nodes (gap 0.1%)
Improved solution       378.38811567 after      21155 iter,      2676 nodes (gap 0.1%)
Improved solution      378.388128675 after      22010 iter,      2859 nodes (gap 0.1%)
Improved solution      378.388135175 after      23526 iter,      3191 nodes (gap 0.1%)
Improved solution      378.388148184 after      25660 iter,      3644 nodes (gap 0.1%)
Improved solution      378.388148191 after      32329 iter,      5028 nodes (gap 0.1%)
Improved solution        378.3881612 after      45950 iter,      7854 nodes (gap 0.1%)
Improved solution      378.397115679 after      55337 iter,     10064 nodes (gap 0.0%)
Improved solution      378.397128684 after      55398 iter,     10083 nodes (gap 0.0%)
Improved solution      378.397128688 after      55578 iter,     10126 nodes (gap 0.0%)
Improved solution      378.397141693 after      55609 iter,     10133 nodes (gap 0.0%)
Improved solution      378.397154698 after      55802 iter,     10184 nodes (gap 0.0%)
Improved solution      378.397161198 after      56385 iter,     10320 nodes (gap 0.0%)
Improved solution      378.397161202 after      56812 iter,     10412 nodes (gap 0.0%)
Improved solution      378.397174207 after      56827 iter,     10416 nodes (gap 0.0%)
Improved solution      378.397174211 after      58523 iter,     10781 nodes (gap 0.0%)
Improved solution       378.39718722 after      60220 iter,     11132 nodes (gap 0.0%)
Improved solution      378.397193722 after      62709 iter,     11665 nodes (gap 0.0%)
Improved solution      378.397206725 after     107007 iter,     20068 nodes (gap 0.0%)
Improved solution      378.397206727 after     107888 iter,     20243 nodes (gap 0.0%)
Improved solution      378.397213229 after     112903 iter,     21202 nodes (gap 0.0%)
Improved solution      378.397219732 after     119524 iter,     22396 nodes (gap 0.0%)
Improved solution      378.397226233 after     280445 iter,     53137 nodes (gap 0.0%)
Improved solution      378.397232737 after     341019 iter,     65025 nodes (gap 0.0%)
Improved solution       378.39723924 after     346775 iter,     66130 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        378.39723924 after     843592 iter,    159227 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 4.44089e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 843592, 60001 (7.1%) were bound flips.
      There were 79633 refactorizations, 0 triggered by time and 0 by density.
       ... on average 9.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22123 NZ entries, 1.0x largest basis.
      The maximum B&B level was 73, 0.0x MIP order, 53 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.213 seconds, presolve used 0.072 seconds,
       ... 7199.939 seconds in simplex solver, in total 7200.224 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 ||*|| = 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 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 64, with a dynamic range of 64000.
      Time to load data was 0.193 seconds, presolve used 0.078 seconds,
       ... 34.730 seconds in simplex solver, in total 35.001 seconds.
Vehicle Type: 0 Num:49 Trip segments:117