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

Relaxed solution       770.935713119 after      20001 iter is B&B base.
 
Feasible solution      770.933329144 after      20130 iter,        46 nodes (gap 0.0%)
Improved solution      770.933393662 after      20168 iter,        62 nodes (gap 0.0%)
Improved solution      770.933419471 after      20205 iter,        77 nodes (gap 0.0%)
Improved solution       770.93345818 after      20237 iter,        91 nodes (gap 0.0%)
Improved solution      770.933496886 after      20342 iter,       135 nodes (gap 0.0%)
Improved solution      770.933522695 after      20379 iter,       150 nodes (gap 0.0%)
Improved solution      770.933561404 after      20411 iter,       164 nodes (gap 0.0%)
Improved solution      770.933561406 after      20620 iter,       252 nodes (gap 0.0%)
Improved solution      770.933561407 after      20748 iter,       311 nodes (gap 0.0%)
Improved solution      770.933587213 after      20977 iter,       409 nodes (gap 0.0%)
Improved solution      770.933587216 after      21102 iter,       468 nodes (gap 0.0%)
Improved solution      770.933600113 after      21390 iter,       590 nodes (gap 0.0%)
Improved solution      770.933600115 after      21515 iter,       649 nodes (gap 0.0%)
Improved solution      770.933613022 after      21873 iter,       806 nodes (gap 0.0%)
Improved solution      770.933664628 after      21912 iter,       823 nodes (gap 0.0%)
Improved solution       770.93366463 after      22244 iter,       973 nodes (gap 0.0%)
Improved solution      770.933677528 after      24154 iter,      2042 nodes (gap 0.0%)
Improved solution      770.933677529 after      24459 iter,      2194 nodes (gap 0.0%)
Improved solution      770.933690437 after      27367 iter,      3532 nodes (gap 0.0%)
Improved solution       770.93369044 after      27385 iter,      3539 nodes (gap 0.0%)
Improved solution      770.933703337 after      28309 iter,      3925 nodes (gap 0.0%)
Improved solution      770.933703339 after      28327 iter,      3932 nodes (gap 0.0%)
Improved solution      770.933716246 after      29009 iter,      4209 nodes (gap 0.0%)
Improved solution      770.933767852 after      29050 iter,      4226 nodes (gap 0.0%)
Improved solution      770.933767854 after      29333 iter,      4377 nodes (gap 0.0%)
Improved solution      770.933780752 after      33561 iter,      6659 nodes (gap 0.0%)
Improved solution      770.933780753 after      33832 iter,      6818 nodes (gap 0.0%)
Improved solution      770.933793661 after      47269 iter,     14216 nodes (gap 0.0%)
Improved solution      770.933793662 after      47531 iter,     14369 nodes (gap 0.0%)
Improved solution      770.933793664 after      48527 iter,     14872 nodes (gap 0.0%)
Improved solution      770.933806564 after      48541 iter,     14879 nodes (gap 0.0%)
Improved solution      770.933819463 after      55693 iter,     18740 nodes (gap 0.0%)
Improved solution      770.933832367 after      67102 iter,     24609 nodes (gap 0.0%)
Improved solution      770.933871076 after      67550 iter,     24788 nodes (gap 0.0%)
Improved solution      770.933883976 after      68364 iter,     25249 nodes (gap 0.0%)
Improved solution      770.933909782 after      89568 iter,     37157 nodes (gap 0.0%)
Improved solution      770.933922682 after      90364 iter,     37608 nodes (gap 0.0%)
Improved solution      770.933961388 after     100870 iter,     43363 nodes (gap 0.0%)
Improved solution      770.934012994 after     112520 iter,     49864 nodes (gap 0.0%)
 
Optimal solution       770.934012994 after     112596 iter,     49900 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 1.07032e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 112596, 21237 (18.9%) were bound flips.
      There were 25032 refactorizations, 0 triggered by time and 0 by density.
       ... on average 3.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 58225 NZ entries, 1.0x largest basis.
      The maximum B&B level was 59, 0.0x MIP order, 51 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.323 seconds, presolve used 0.186 seconds,
       ... 3906.205 seconds in simplex solver, in total 3906.714 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.304 seconds, presolve used 0.180 seconds,
       ... 228.869 seconds in simplex solver, in total 229.353 seconds.
Vehicle Type: 0 Num:42 Trip segments:154