Summary
Separably-infinite programs are a class of linear infinite programs that are related to semi-infinite programs and which have applications in economics and statistics. These programs have an infinite number of variables and an infinite number of constraints. However, only a finite number of variables appear in an infinite number of constraints, and only a finite number of constraints have an infinite number of variables. Duality in this class of programs is studied and used to develop a system of nonlinear equations satisfied by optimal solutions of the primal and dual programs. This nonlinear system has uses in numerical techniques for solving separably-infinite programs.
Zusammenfassung
Bei den in diesem Beitrag untersuchten separabel-infiniten Programmen handelt es sich um lineare Programme mit unendlich vielen Variablen und unendlich vielen Nebenbedingungen, wobei nur endlich viele Variablen in unendlich vielen Nebenbedingungen vorkommen und nur endlich viele Nebenbedingungen unendlich viele Variablen haben. Für diese Programme, die in einem engen Zusammenhang zu semi-infiniten Programmen stehen, wird eine Dualitätstheorie entwickelt, die Grundlage für numerische Verfahren zur Lösung von separabel-infiniten Programmen ist.
Similar content being viewed by others
References
Charnes, A., W. W. Cooper andK.O. Kortanek: Duality, Haar Programs and Finite Sequence Spaces. Proc. Nat. Acad. Sci., U.S.A.,68, 1962, 605–608.
—: On the Theory of Semi-infinite Programming and a Generalization of the Kuhn-Tucker Saddle Point Theorem for Arbitrary Convex Functions. N.R.L.Q.16, 1969, 41–51.
Duffin, R.J.: Infinite Programs. Linear Inequalities and Related Systems. Ed. by H.W. Kuhn and A. Tucker. Princeton, New Jersey, 1956, 157–170.
Fahlander, K.: Computer Programs for Semi-infinite Optimization. Swedish Institute for Applied Mathematics, Stockholm TRITA-NA-7312, 1973.
Glashoff, K.: Duality Theory of Semi-infinite Programming. Semi-Infinite Programming. Ed. by. R. Hettich, Lecture Notes in Control and Information Sciences. Ed. by A.V. Balakrishnan and M. Thomas. Berlin-Heidelberg-New York 1979.
Gribik, P.R., andK.O. Kortanek: Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems. SIAM J. Appl. Math.32, 1977, 232–259.
Gustafson, S.-Å.: Nonlinear Systems in Semi-infinite Programming. Solutions of Nonlinear Equations. Ed. by G.B. Brynes and C.A. Hall. New York 1973, 63–99.
Gustafson, S.-Å., andK.O. Kortanek: Numerical Solution of a Class of Semi-infinite Programming Problems. N.R.L.Q.20, 1973, 477–504.
Rockafellar, R.T.: Convex Analysis. Princeton, New Jersey, 1970.
Stoer, J., andC. Witzgal: Convexity and Optimization in Finite Dimensions I. New York 1970.
Author information
Authors and Affiliations
Additional information
Research partially supported by the Office of Naval Research, Contract No. N00014-75-C-0569.
Research partially supported by National Science Foundation, Grant NSF ENG76-05191.
Rights and permissions
About this article
Cite this article
Charnes, A., Gribik, P.R. & Kortanek, K.O. Separably-infinite programs. Zeitschrift für Operations Research 24, 33–45 (1980). https://doi.org/10.1007/BF01920270
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01920270