Convergence behavior of decomposition algorithms for linear programs
From MaRDI portal
Publication:799585
DOI10.1016/0167-6377(84)90048-8zbMath0547.90067OpenAlexW2153050393MaRDI QIDQ799585
Publication date: 1984
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(84)90048-8
large scale systemsconvergence behaviorauxiliary proceduresDantzig-Wolfe decomposition algorithmnumerical inaccuracy
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical behavior of LP algorithms based upon the decomposition principle
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- A Structured Linear Programming Model in the Food Industry
- Nested decomposition for dynamic models
- Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
- Experiences in Using a Decomposition Program