Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 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         18211 iter.

Relaxed solution       768.849710094 after      20073 iter is B&B base.
 
Feasible solution      768.054935376 after      20591 iter,        45 nodes (gap 0.1%)
Improved solution       768.08793537 after      20601 iter,        47 nodes (gap 0.1%)
Improved solution      768.087987002 after      22345 iter,       263 nodes (gap 0.1%)
Improved solution      768.087999902 after      23775 iter,       463 nodes (gap 0.1%)
Improved solution      768.092922466 after     199856 iter,     25624 nodes (gap 0.1%)
Improved solution      768.092974092 after     199871 iter,     25628 nodes (gap 0.1%)
Improved solution      768.093012804 after     200697 iter,     25703 nodes (gap 0.1%)
Improved solution      768.093012805 after     201310 iter,     25758 nodes (gap 0.1%)
Improved solution      768.093012812 after     220940 iter,     28440 nodes (gap 0.1%)
Improved solution      768.093025712 after     263660 iter,     35621 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       768.093025712 after     325467 iter,     44804 nodes (gap 0.1%).

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 325467, 15238 (4.7%) were bound flips.
      There were 22467 refactorizations, 0 triggered by time and 0 by density.
       ... on average 13.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57873 NZ entries, 1.0x largest basis.
      The maximum B&B level was 84, 0.0x MIP order, 49 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.305 seconds, presolve used 0.181 seconds,
       ... 7199.893 seconds in simplex solver, in total 7200.379 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 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       9294 iter is B&B base.
 
Feasible solution                  0 after       9294 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       9294 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 9294, 0 (0.0%) were bound flips.
      There were 39 refactorizations, 0 triggered by time and 0 by density.
       ... on average 238.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 39176 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.324 seconds, presolve used 0.191 seconds,
       ... 226.268 seconds in simplex solver, in total 226.783 seconds.
Vehicle Type: 0 Num:35 Trip segments:153