Abstract
The purpose of this article is to propose a simple framework for the various decomposition schemes in mathematical programming.
Special instances are discussed. Particular attention is devoted to the general mathematical programming problem with two sets of variables. An economic interpretation in the context of hierarchical planning is done for the suggested decomposition procedure.
The framework is based on general duality theory in mathematical programming and thus focussing on approaches leading to global optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benders, J. F. (1962), Partitioning Procedures for Solving Mixed-Variables Programming Problems, Numerische Mathematik 4, 238–252.
Dantzig, G. B. and Wolfe, P. (1961), The Decomposition Algorithm for Linear Programs, Econometrica 9, 767–778.
Dirickx, Y. M. I. and Jennergren, L. P. (1979), Systems Analysis by Multi-Level Methods; With Applications to Economics and Management, Wiley.
Burton, R. M. and Obel, B. (1984), Designing Efficient Organizations; Modelling and Experimentation, Advanced Series in Management 7, North-Holland.
Obel, B. (1981), Issues of Organizational Design; A Mathematical Programming View of Organizations, Pergamon Press.
Geoffrion, A. M. (1970), Primal Resource Directive Approaches for Optimizing Nonlinear Decomposable Systems, Operations Research 18, 375–403.
Holloway, C. A. (1973), A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs, Operations Research 21, 210–220.
Wolsey, L. A. (1981), A Resource Decomposition Algorithm for General Mathematical Programs, Mathematical Programming Study 14, 244–257.
Burkard, R. E., Hamacher, H. W., and Tind, J. (1985), On General Decomposition Schemes in Mathematical Programming, Mathematical Programming Study 24, 238–252.
Flippo, O. E. (1989), Stability, Duality and Decomposition in General Mathematical Programming, PhD Thesis, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.
VanRoy, T. J. (1983), Cross Decomposition for Mixed Integer Programming, Mathematical Programming 25, 46–63.
Tind, J. and Wolsey, L. A. (1981), An Elementary Survey of General Duality Theory in Mathematical Programming, Mathematical Programming 21, 241–261.
Geoffrion, A. M. (1972), Generalized Benders Decomposition, J. of Optimization Theory and Applications 10, 237–260.
VanRoy, T. J. (1986), A Cross Decomposition Algorithm for Capacitated Facility Location, Operations Research 34, 145–163.
Kornai, J. and Lipták, T. (1965), Two-Level Planning, Econometrica 33, 141–169.
Holmberg, K. (1990), Linear Mean Value Cross Decomposition: A Generalization of the Kornai-Lipták Method, Publication no: 90/1, Department of Operations Research, University of Aarhus, Aarhus, Denmark, to appear in European J. of Operational Research.
Holmberg, K. (1985), Decomposition in Large Scale Mathematical Progamming, Dissertation, Department of Mathematics, Linköping University, Linköping, Sweden.
Holm, S. and Tind, J. (1988), A Unified Approach for Price Directive Decomposition Procedures in Integer Programming, Discrete Applied Mathematics 20, 205–219.
Aardal, K. and Ari, A. (1990), On the Resemblance between the Kornai-Lipták and Cross Decomposition Techniques for Block-Angular Linear Programs, European J. of Operational Research 46, 393–398.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tind, J. Decomposition in global optimization. J Glob Optim 1, 131–144 (1991). https://doi.org/10.1007/BF00119987
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00119987