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

Relaxed solution       24.3449891285 after      18794 iter is B&B base.
 
Feasible solution       24.334421236 after      18989 iter,        23 nodes (gap 0.0%)
Improved solution       24.334440745 after      21619 iter,       508 nodes (gap 0.0%)
Improved solution       24.334440746 after      22821 iter,       734 nodes (gap 0.0%)
Improved solution       24.334447248 after      29646 iter,      2024 nodes (gap 0.0%)
Improved solution        24.33444725 after      31356 iter,      2356 nodes (gap 0.0%)
Improved solution       24.334453748 after      37201 iter,      3457 nodes (gap 0.0%)
Improved solution       24.334453749 after      37269 iter,      3474 nodes (gap 0.0%)
Improved solution       24.335388718 after     117170 iter,     20023 nodes (gap 0.0%)
Improved solution       24.335408227 after     118588 iter,     20256 nodes (gap 0.0%)
Improved solution       24.335440743 after     120948 iter,     20599 nodes (gap 0.0%)
Improved solution       24.335440744 after     147092 iter,     24698 nodes (gap 0.0%)
Improved solution       24.335447246 after     223109 iter,     36182 nodes (gap 0.0%)
Improved solution       24.335447254 after     247269 iter,     39688 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        24.335447254 after     269367 iter,     43403 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 269367, 16972 (6.3%) were bound flips.
      There were 21766 refactorizations, 0 triggered by time and 0 by density.
       ... on average 11.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57864 NZ entries, 1.0x largest basis.
      The maximum B&B level was 69, 0.0x MIP order, 42 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.375 seconds, presolve used 0.199 seconds,
       ... 7199.822 seconds in simplex solver, in total 7200.396 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 ||*|| = 0

 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 64, with a dynamic range of 64000.
      Time to load data was 0.393 seconds, presolve used 0.224 seconds,
       ... 297.488 seconds in simplex solver, in total 298.105 seconds.
Vehicle Type: 0 Num:24 Trip segments:85