A note on mixed procedures for decomposing linear programming problems
Author:
- 1 January 1978
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 9 (4) , 537-544
Abstract
This paper shows how to combine primal and dual decomposition procedures where both a vertical and a horizontal decomposition approach can be applied. The motivation for using a mixed procedure is that it improves the possibility of efficiently initializing the procedure, which has been shown to be crucial for the convergence of the procedures, Additionally mixed procedures have important interpretations as mixed price and budget planning procedures for decentralized organizations.Keywords
This publication has 4 references indexed in Scilit:
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- Decomposition of Linear Programs by Direct DistributionEconometrica, 1972
- Convex Analysis1970
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961