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

Relaxed solution       21.2999912303 after      18192 iter is B&B base.
 
Feasible solution       21.299083928 after      18270 iter,        19 nodes (gap 0.0%)
Improved solution       21.299122633 after      18419 iter,        75 nodes (gap 0.0%)
Improved solution       21.299135548 after      18483 iter,        98 nodes (gap 0.0%)
Improved solution       21.299148448 after      18508 iter,       111 nodes (gap 0.0%)
Improved solution        21.29914845 after      19087 iter,       288 nodes (gap 0.0%)
Improved solution       21.299161348 after      19112 iter,       301 nodes (gap 0.0%)
Improved solution       21.299174257 after      19222 iter,       336 nodes (gap 0.0%)
Improved solution       21.299187157 after      19248 iter,       349 nodes (gap 0.0%)
Improved solution       21.299200057 after      21074 iter,       940 nodes (gap 0.0%)
Improved solution       21.299212954 after      23200 iter,      1611 nodes (gap 0.0%)
Improved solution       21.299225863 after      23416 iter,      1682 nodes (gap 0.0%)
Improved solution       21.299238763 after      23440 iter,      1695 nodes (gap 0.0%)
 
Optimal solution        21.299238763 after      23597 iter,      1762 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 23597, 609 (2.6%) were bound flips.
      There were 956 refactorizations, 0 triggered by time and 0 by density.
       ... on average 24.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57686 NZ entries, 1.0x largest basis.
      The maximum B&B level was 27, 0.0x MIP order, 24 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.333 seconds, presolve used 0.228 seconds,
       ... 588.600 seconds in simplex solver, in total 589.161 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.363 seconds, presolve used 0.243 seconds,
       ... 324.427 seconds in simplex solver, in total 325.033 seconds.
Vehicle Type: 0 Num:19 Trip segments:59