Testing of a large-scale network optimization program |
| |
Authors: | John M. Mulvey |
| |
Affiliation: | (1) Harvard University, Cambridge, MA, USA |
| |
Abstract: | This paper describes the experimental results of testing a large-scale program for solving minimum-cost network flow problems. With this program, general structure transshipment problems with over ten thousand nodes and thirty thousand arcs have been easily solved without resorting to auxiliary storage. The algorithm is a variant of the primal revised simplex method; the computer code is called LPNET illustrating the close connection between linear programming and network graphs. This approach substantially improves computer processing timeand core storage, especially for relatively large network problems. The results of these experiments are provided. It is emphasized that an organized experimental design and a detailed series of empirical tests are crucial for an efficient implementation.Research supported in part by TRW Systems Group and Harvard Business School. |
| |
Keywords: | Network Flow Problems Computational Results— Efficiency— Comparison Specific problems in mathematical programming Computational Experiments Pivotal Selection Methods Starting Strategies Scaling Procedure |
本文献已被 SpringerLink 等数据库收录! |