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

Relaxed solution       386.463854039 after      19741 iter is B&B base.
 
Feasible solution      386.065935376 after      20354 iter,        45 nodes (gap 0.1%)
Improved solution       386.08393537 after      20368 iter,        47 nodes (gap 0.1%)
Improved solution      386.083987002 after      22859 iter,       263 nodes (gap 0.1%)
Improved solution      386.083999902 after      25000 iter,       611 nodes (gap 0.1%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       386.083999902 after     245479 iter,     43576 nodes (gap 0.1%).

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

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 245479, 17221 (7.0%) were bound flips.
      There were 21852 refactorizations, 0 triggered by time and 0 by density.
       ... on average 10.4 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57930 NZ entries, 1.0x largest basis.
      The maximum B&B level was 79, 0.0x MIP order, 42 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.300 seconds, presolve used 0.198 seconds,
       ... 7199.842 seconds in simplex solver, in total 7200.340 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.480 seconds, presolve used 0.236 seconds,
       ... 358.854 seconds in simplex solver, in total 359.570 seconds.
Vehicle Type: 0 Num:36 Trip segments:155