论文信息 - Computational experience with advanced implementation of decomposition algorithms for linear programming

Computational experience with advanced implementation of decomposition algorithms for linear programming

This paper reports computational experience with the codesDecompsx andLift which are built on IBM's MPSX/370 LP software for large-scale structured programs.Decompsx is an implementation of the Dantzig-Wolfe decomposition algorithm for block-angular LP's.Lift is an implementation of a nested decomposition algorithm for staircase and block-triangular LP's. A diverse collection of test problems drawn from real applications is used to test these codes, including multinational energy models and global economic models.

James K. Ho | Etienne Loute

[1] James K. Ho,et al. Computational aspects of DYNAMICO: a model of trade and development in the world economy , 1984 .

[2] G. Dantzig,et al. THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[3] G. B. Dantzig,et al. On a Pilot Linear Programming Model for Assessing Physical Impact on the Economy of a Changing Energy Picture , 1975 .

[4] James K. Ho,et al. A Comparative Study of Two Methods for Staircase Linear Programs , 1980, TOMS.

[5] L. Peter Jennergren,et al. Trade and development in the world economy: Methodological features of Project DYNAMICO , 1982 .

[6] Alan S. Manne,et al. Nested decomposition for dynamic models , 1974, Math. Program..

[7] James K. Ho,et al. A set of staircase linear programming test problems , 1981, Math. Program..

[8] James K. Ho,et al. An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming , 1981, Math. Program..