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 4350 iter. Relaxed solution 384.483881744 after 4580 iter is B&B base. Feasible solution 384.178361374 after 5659 iter, 117 nodes (gap 0.1%) Improved solution 384.178374383 after 5743 iter, 142 nodes (gap 0.1%) Improved solution 384.18738739 after 5845 iter, 167 nodes (gap 0.1%) Improved solution 384.193400401 after 5930 iter, 191 nodes (gap 0.1%) Improved solution 384.200400397 after 6173 iter, 243 nodes (gap 0.1%) Improved solution 384.206400397 after 6323 iter, 276 nodes (gap 0.1%) Improved solution 384.206413402 after 6595 iter, 330 nodes (gap 0.1%) Improved solution 384.207387378 after 6756 iter, 362 nodes (gap 0.1%) Improved solution 384.207400389 after 6816 iter, 379 nodes (gap 0.1%) Improved solution 384.213400389 after 7062 iter, 435 nodes (gap 0.1%) Improved solution 384.213413394 after 7431 iter, 513 nodes (gap 0.1%) Improved solution 384.213426405 after 7579 iter, 548 nodes (gap 0.1%) Improved solution 384.213439408 after 8622 iter, 778 nodes (gap 0.1%) Improved solution 384.213452415 after 9260 iter, 928 nodes (gap 0.1%) Improved solution 384.218374371 after 11296 iter, 1342 nodes (gap 0.1%) Improved solution 384.218387382 after 11302 iter, 1345 nodes (gap 0.1%) Improved solution 384.218400389 after 11827 iter, 1443 nodes (gap 0.1%) Improved solution 384.219374369 after 12184 iter, 1515 nodes (gap 0.1%) Improved solution 384.219400389 after 12292 iter, 1540 nodes (gap 0.1%) Improved solution 384.219413396 after 12542 iter, 1585 nodes (gap 0.1%) Improved solution 384.225413396 after 12851 iter, 1640 nodes (gap 0.1%) Improved solution 384.225426401 after 13293 iter, 1726 nodes (gap 0.1%) Improved solution 384.22543941 after 14144 iter, 1875 nodes (gap 0.1%) Improved solution 384.225452413 after 15922 iter, 2193 nodes (gap 0.1%) Improved solution 384.22546542 after 19110 iter, 2761 nodes (gap 0.1%) Improved solution 384.225478423 after 36909 iter, 5788 nodes (gap 0.1%) Improved solution 384.230387376 after 37426 iter, 5887 nodes (gap 0.1%) Improved solution 384.230413396 after 37572 iter, 5920 nodes (gap 0.1%) Improved solution 384.230426403 after 38007 iter, 6008 nodes (gap 0.1%) Improved solution 384.23043941 after 39740 iter, 6362 nodes (gap 0.1%) Improved solution 384.230452415 after 42023 iter, 6810 nodes (gap 0.1%) Improved solution 384.230465422 after 49039 iter, 8218 nodes (gap 0.1%) Improved solution 384.230478427 after 55905 iter, 9572 nodes (gap 0.1%) Improved solution 384.230491432 after 70268 iter, 12439 nodes (gap 0.1%) Improved solution 384.230504435 after 92086 iter, 16694 nodes (gap 0.1%) Improved solution 384.230504437 after 149151 iter, 28092 nodes (gap 0.1%) Improved solution 384.230517442 after 191172 iter, 36781 nodes (gap 0.1%) Improved solution 384.230530447 after 284432 iter, 55889 nodes (gap 0.1%) Improved solution 384.230543452 after 428528 iter, 86401 nodes (gap 0.1%) Improved solution 384.230556457 after 593907 iter, 121513 nodes (gap 0.1%) Improved solution 384.230569462 after 1348524 iter, 284973 nodes (gap 0.1%) Improved solution 384.230582467 after 1674127 iter, 359147 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 384.230582467 after 2022891 iter, 433755 nodes (gap 0.1%). Excellent numeric accuracy ||*|| = 1.77636e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2022891, 267881 (13.2%) were bound flips. There were 216854 refactorizations, 0 triggered by time and 4 by density. ... on average 8.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10124 NZ entries, 1.0x largest basis. The maximum B&B level was 128, 0.1x MIP order, 117 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.092 seconds, presolve used 0.041 seconds, ... 7199.964 seconds in simplex solver, in total 7200.097 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 ||*|| = 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 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 64, with a dynamic range of 64000. Time to load data was 0.064 seconds, presolve used 0.039 seconds, ... 5.508 seconds in simplex solver, in total 5.611 seconds. Vehicle Type: 0 Num:88 Trip segments:218