Abstract
Decomposition methods can provide the rescue from the “curse of dimensionality”, which often prevents the successful numerical solution of large scale nonlinear mathematical programming problems. A symmetric nonlinear decomposition theory has been elaborated by T.O.M. Kronsjö (4) as an extension of a theory by the same author (3). The stringent proof of the convergence of this decomposition algorithm requires some results on necessary optimality conditions for certain mathematical programming problems. In this paper we state and prove some theorems providing these results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.S.Bazaraa and C.M.Shetty: Nonlinear Programming: Theory and Algorithms. John Wiley and Sons, New York, 1979.
G.B.Dantzig, E.Eisenberg, and R.W.Cottle: Symmetric Dual Nonlinear Programs. Pacific Journal of Mathematics, 15, 1965, pp. 809–812.
T.O.M.Kronsjö: Decomposition of a Large Nonlinear Convex Separable Economic System in the Dual Direction. Economics of Planning, 9, 1969, pp. 71–94.
T.O.M.Kronsjö: A General Symmetric Nonlinear Decomposition Theory. In D.M.Himmelblau (ed.): Decomposition of Large-Scale Problems. North-Holland, Amsterdam, 1973, pp. 541–561.
L.S.Lasdon: Optimization Theory for Large Systems. Macmillan, New York, 1970.
S.Vajda: Theory of Linear and Non-Linear Programming. Longman, London, 1974.
P.Wolfe: Convergence Theory in Nonlinear Programming. In J.Abadie (ed.): Integer and Nonlinear Programming North-Holland, Amsterdam, 1970, pp. 1–36.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sandblom, CL. Theorems related to symmetric nonlinear decomposition. ECONOMICS OF PLANNING 14, 167–170 (1978). https://doi.org/10.1007/BF00367146
Issue Date:
DOI: https://doi.org/10.1007/BF00367146