Convergence behavior of decomposition algorithms for linear programs
DOI10.1016/0167-6377(84)90048-8zbMATH Open0547.90067OpenAlexW2153050393MaRDI QIDQ799585FDOQ799585
Authors: James K. Ho
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
Recommendations
- Numerical behavior of LP algorithms based upon the decomposition principle
- Using central prices in the decomposition of linear programs
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Decomposition in general mathematical programming
- The decomposition principle and algorithms for linear programming
large scale systemsconvergence behaviorauxiliary proceduresDantzig-Wolfe decomposition algorithmnumerical inaccuracy
Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)
Cites Work
- The Decomposition Algorithm for Linear Programs
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational experience with advanced implementation of decomposition algorithms for linear programming
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- Nested decomposition for dynamic models
- Numerical behavior of LP algorithms based upon the decomposition principle
- Computational aspects of DYNAMICO : a model of trade and development in the world economy
- Title not available (Why is that?)
- A Structured Linear Programming Model in the Food Industry
- Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
- Experiences in Using a Decomposition Program
Cited In (3)
This page was built for publication: Convergence behavior of decomposition algorithms for linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799585)