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

Relaxed solution       24.2269925839 after       8292 iter is B&B base.
 
Feasible solution       24.225473335 after       8576 iter,        33 nodes (gap 0.0%)
Improved solution       24.225499351 after       8594 iter,        39 nodes (gap 0.0%)
Improved solution       24.225525359 after       8771 iter,        63 nodes (gap 0.0%)
Improved solution       24.225551369 after       8854 iter,        75 nodes (gap 0.0%)
Improved solution       24.225577379 after       8953 iter,        93 nodes (gap 0.0%)
Improved solution       24.226583883 after       9125 iter,       138 nodes (gap 0.0%)
Improved solution       24.226590389 after       9648 iter,       268 nodes (gap 0.0%)
Improved solution       24.226596889 after       9829 iter,       323 nodes (gap 0.0%)
Improved solution       24.226603392 after      10990 iter,       615 nodes (gap 0.0%)
Improved solution       24.226609892 after      11350 iter,       714 nodes (gap 0.0%)
Improved solution       24.226622895 after      13022 iter,      1189 nodes (gap 0.0%)
Improved solution       24.226629398 after      17400 iter,      2490 nodes (gap 0.0%)
Improved solution       24.226635898 after      17448 iter,      2507 nodes (gap 0.0%)
 
Optimal solution        24.226635898 after      29894 iter,      6370 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 29894, 2427 (8.1%) were bound flips.
      There were 3222 refactorizations, 0 triggered by time and 0 by density.
       ... on average 8.5 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 21971 NZ entries, 1.0x largest basis.
      The maximum B&B level was 38, 0.0x MIP order, 29 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.214 seconds, presolve used 0.076 seconds,
       ... 247.028 seconds in simplex solver, in total 247.318 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.192 seconds, presolve used 0.079 seconds,
       ... 31.957 seconds in simplex solver, in total 32.228 seconds.
Vehicle Type: 0 Num:22 Trip segments:56