Abstract
The problem of how to decompose linear programming problems and economic planning rpoblems has excited investigators and attracted their attention not only because of the necessity of solving high dimensional problems on calculating machines with limited storage space. Another no less Important fact is that decomposition techniques are in essence mathematical models for the processes of control and planning, implementing the division of these functions between a central planning organisation and the remaining sections of the economy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 D. Reidel Publishing Company
About this chapter
Cite this chapter
Razumikhin, B.S. (1984). Decomposition Methods for Linear Programming Problems. In: Physical Models and Equilibrium Methods in Programming and Economics. Mathematics and Its Applications, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-6274-3_8
Download citation
DOI: https://doi.org/10.1007/978-94-009-6274-3_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-6276-7
Online ISBN: 978-94-009-6274-3
eBook Packages: Springer Book Archive