Zusammenfassung
Es wird eine allgemeine Formulierung des Dekompositionsverfahrens zur Lösung konvex-konkaver Sattelpunktprobleme angegeben.
Summary
A general formulation of decomposition methods for finding saddle-points of convexconcave functions is proposed.
Literaturverzeichnis
Dantzig, G. B.: General convex objective forms. In: Mathematical Methods in the Social Sciences (K. J. Arrow, S. Karlin, P. Suppes ed.), pp. 151–158. Stanford University Press, Stanford 1960.
Benders, J. F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math.4, 238–252, 1962.
Broise, P., P. Huard undJ. Sentenac: Décomposition des programmes mathématiques. Dunod, Paris 1968.
Kronsjö, T. O. M.: Decomposition of a nonlinear convex separable economic system in primal and dual directions. In: Optimization (R. Fletcher ed.), pp. 85–97. Academic Press, London 1969.
Himmelblau, D. M. (Ed.): Decomposition of Large-Scale Problems. North-Holland Elsevier, Amsterdam 1973.
Stoer, J.: Duality in nonlinear programming and the minimax theorem. Numer. Math.5, 371–379, 1963.
Frank, M., undP. Wolfe: An algorithm for quadratic programming. Naval Res. Logist. Quart.3, 95–110, 1956.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Oettli, W. Eine allgemeine, symmetrische Formulierung des Dekompositionsprinzips für duale Paare nichtlinearer Minmax- und Maxmin-Probleme. Zeitschrift für Operations Research 18, 1–18 (1974). https://doi.org/10.1007/BF01949709
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01949709