Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 4284 iter. Relaxed solution 385.529889325 after 4771 iter is B&B base. Feasible solution 385.115728984 after 5915 iter, 79 nodes (gap 0.1%) Improved solution 385.11578061 after 6226 iter, 117 nodes (gap 0.1%) Improved solution 385.115832236 after 6532 iter, 155 nodes (gap 0.1%) Improved solution 385.123832238 after 7300 iter, 247 nodes (gap 0.1%) Improved solution 385.124832238 after 7440 iter, 261 nodes (gap 0.1%) Improved solution 385.124858049 after 7699 iter, 296 nodes (gap 0.1%) Improved solution 385.12488386 after 8194 iter, 345 nodes (gap 0.1%) Improved solution 385.124909671 after 8200 iter, 348 nodes (gap 0.1%) Improved solution 385.132858047 after 8728 iter, 423 nodes (gap 0.1%) Improved solution 385.132858049 after 8960 iter, 464 nodes (gap 0.1%) Improved solution 385.132909671 after 9469 iter, 540 nodes (gap 0.1%) Improved solution 385.132961293 after 19891 iter, 2241 nodes (gap 0.1%) Improved solution 385.132987102 after 65860 iter, 10179 nodes (gap 0.1%) Improved solution 385.133012917 after 71664 iter, 11379 nodes (gap 0.1%) Improved solution 385.133038724 after 224239 iter, 41585 nodes (gap 0.1%) Improved solution 385.133064539 after 230820 iter, 42971 nodes (gap 0.1%) Improved solution 385.133090346 after 397528 iter, 76839 nodes (gap 0.1%) Improved solution 385.133116161 after 404149 iter, 78223 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 385.133116161 after 2276817 iter, 404662 nodes (gap 0.1%). 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 2276817, 224871 (9.9%) were bound flips. There were 202326 refactorizations, 0 triggered by time and 3 by density. ... on average 10.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10137 NZ entries, 1.0x largest basis. The maximum B&B level was 87, 0.1x MIP order, 69 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.067 seconds, presolve used 0.032 seconds, ... 7199.974 seconds in simplex solver, in total 7200.073 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 1558 iter is B&B base. Feasible solution 0 after 1558 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1558 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 1558, 0 (0.0%) were bound flips. There were 8 refactorizations, 0 triggered by time and 0 by density. ... on average 194.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.067 seconds, presolve used 0.036 seconds, ... 5.654 seconds in simplex solver, in total 5.757 seconds. Vehicle Type: 0 Num:51 Trip segments:146