Abstract
This paper deals with methods for solving linear programming models with a primal or dual block-angular structure. A more general exposition of these methods can be found in [1]. For a primal block- angular structure the method is called the dual basis decomposition method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
C. van de Panne, “Local Décomposition Methods for Linear Prograrnning”. European Journal of Operational Research Vol. 28 (1987), pp. 369–381
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van de Panne, C. (1989). Decentralized Optimization for Structured Linear Programming Models. In: Wallace, S.W. (eds) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83724-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-83724-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83726-5
Online ISBN: 978-3-642-83724-1
eBook Packages: Springer Book Archive