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

Relaxed solution       22.2119925607 after       8392 iter is B&B base.
 
Feasible solution       22.208932357 after       8605 iter,        29 nodes (gap 0.0%)
Improved solution        22.20893416 after       8638 iter,        39 nodes (gap 0.0%)
Improved solution       22.208935967 after       8678 iter,        45 nodes (gap 0.0%)
Improved solution       22.208938672 after       9075 iter,       111 nodes (gap 0.0%)
Improved solution       22.208940476 after      10494 iter,       402 nodes (gap 0.0%)
Improved solution       22.208941378 after     690600 iter,    185662 nodes (gap 0.0%)
Improved solution       22.208942279 after     696540 iter,    187222 nodes (gap 0.0%)
Improved solution       22.208943181 after     714083 iter,    192143 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution        22.208943181 after     764590 iter,    208063 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 764590, 66017 (8.6%) were bound flips.
      There were 104057 refactorizations, 0 triggered by time and 0 by density.
       ... on average 6.7 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22036 NZ entries, 1.0x largest basis.
      The maximum B&B level was 59, 0.0x MIP order, 40 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.190 seconds, presolve used 0.074 seconds,
       ... 7199.948 seconds in simplex solver, in total 7200.212 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           105 iter.

Relaxed solution                   0 after       3479 iter is B&B base.
 
Feasible solution                  0 after       3479 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       3479 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 3479, 0 (0.0%) were bound flips.
      There were 16 refactorizations, 0 triggered by time and 0 by density.
       ... on average 217.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 14574 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 8, with a dynamic range of 8000.
      Time to load data was 0.189 seconds, presolve used 0.074 seconds,
       ... 31.993 seconds in simplex solver, in total 32.256 seconds.
Vehicle Type: 0 Num:26 Trip segments:63