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

Relaxed solution        24.231993146 after       8147 iter is B&B base.
 
Feasible solution       24.222251674 after       8365 iter,        22 nodes (gap 0.0%)
Improved solution       24.222277479 after       8377 iter,        26 nodes (gap 0.0%)
Improved solution       24.222303284 after       8454 iter,        37 nodes (gap 0.0%)
Improved solution       24.222329089 after       8468 iter,        41 nodes (gap 0.0%)
Improved solution       24.222341991 after      10572 iter,       293 nodes (gap 0.0%)
Improved solution       24.222354895 after      11016 iter,       353 nodes (gap 0.0%)
Improved solution       24.223277475 after      12533 iter,       565 nodes (gap 0.0%)
Improved solution        24.22329038 after      12537 iter,       568 nodes (gap 0.0%)
Improved solution       24.223303284 after      13394 iter,       659 nodes (gap 0.0%)
Improved solution       24.223329089 after      13620 iter,       693 nodes (gap 0.0%)
Improved solution        24.22332909 after      15789 iter,       950 nodes (gap 0.0%)
Improved solution       24.223354895 after      16279 iter,      1029 nodes (gap 0.0%)
Improved solution       24.223354896 after      20361 iter,      1528 nodes (gap 0.0%)
Improved solution       24.224264574 after      29945 iter,      2901 nodes (gap 0.0%)
Improved solution       24.224277478 after      29956 iter,      2903 nodes (gap 0.0%)
Improved solution       24.224290382 after      30447 iter,      2970 nodes (gap 0.0%)
Improved solution       24.224316187 after      31011 iter,      3041 nodes (gap 0.0%)
Improved solution       24.224329086 after      34297 iter,      3475 nodes (gap 0.0%)
Improved solution       24.224329089 after      34747 iter,      3531 nodes (gap 0.0%)
Improved solution       24.224354894 after      39791 iter,      4202 nodes (gap 0.0%)
Improved solution       24.224354895 after      42785 iter,      4592 nodes (gap 0.0%)
Improved solution       24.225277478 after      45009 iter,      4869 nodes (gap 0.0%)
Improved solution       24.225290379 after      45018 iter,      4872 nodes (gap 0.0%)
Improved solution       24.225290382 after      45176 iter,      4894 nodes (gap 0.0%)
Improved solution       24.225329088 after      45254 iter,      4910 nodes (gap 0.0%)
Improved solution       24.225329089 after      47000 iter,      5147 nodes (gap 0.0%)
Improved solution       24.225354894 after      47441 iter,      5210 nodes (gap 0.0%)
Improved solution       24.225354895 after      54601 iter,      6082 nodes (gap 0.0%)
Improved solution       24.225354896 after      64359 iter,      7330 nodes (gap 0.0%)
Improved solution       24.225354897 after      76023 iter,      8942 nodes (gap 0.0%)
Improved solution         24.2253807 after     101127 iter,     12923 nodes (gap 0.0%)
Improved solution       24.226290381 after     103077 iter,     13202 nodes (gap 0.0%)
Improved solution       24.226341991 after     103239 iter,     13247 nodes (gap 0.0%)
Improved solution         24.2263807 after     103443 iter,     13275 nodes (gap 0.0%)
Improved solution       24.226380701 after     107205 iter,     13739 nodes (gap 0.0%)
Improved solution       24.226380702 after     127768 iter,     16434 nodes (gap 0.0%)
Improved solution       24.226380703 after     152443 iter,     20248 nodes (gap 0.0%)
 
Optimal solution        24.226380703 after     294335 iter,     42096 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 1.06581e-14

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 294335, 28451 (9.7%) were bound flips.
      There were 21084 refactorizations, 0 triggered by time and 1 by density.
       ... on average 12.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 22046 NZ entries, 1.0x largest basis.
      The maximum B&B level was 39, 0.0x MIP order, 32 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.244 seconds, presolve used 0.076 seconds,
       ... 2152.552 seconds in simplex solver, in total 2152.872 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 ||*|| = 0

 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 128, with a dynamic range of 128000.
      Time to load data was 0.169 seconds, presolve used 0.084 seconds,
       ... 31.453 seconds in simplex solver, in total 31.706 seconds.
Vehicle Type: 0 Num:20 Trip segments:48