Optimierungsaufgaben in topologischen Vektorräumen I: Dualitätstheorie
暂无分享，去创建一个
[1] R. Duffin. 6. Infinite Programs , 1957 .
[2] N. Bourbaki. Espaces vectoriels topologiques , 1955 .
[3] Kennan T. Smith,et al. Linear Topological Spaces , 1966 .
[4] R. Rockafellar. Duality theorems for convex functions , 1964 .
[5] A NOTE ON THE LAGRANGIAN SADDLE-POINTS , 1958 .
[6] W. Fenchel. Convex cones, sets, and functions , 1953 .
[7] T. T. West. J. L. Kelley, I. Namioka and others, Linear Topological Spaces (University Series in Higher Mathematics, D. van Nostrand Co. Ltd., 1963) , 1964, Proceedings of the Edinburgh Mathematical Society.
[8] G. Köthe. Topologische lineare Räume , 1960 .
[9] E. Eisenberg. Duality in homogeneous programming , 1961 .
[10] Samuel Karlin,et al. Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .
[11] Helly’s theorem and minima of convex functions , 1965 .
[12] Ulrich Dieter. Dualität bei konvexen Optimierungs-(Programmierungs-)Aufgaben , 1965, Unternehmensforschung.
[13] A. Charnes,et al. Duality in Semi-Infinite Programs and some Works of Haar and Caratheodory , 1963 .
[14] K. S. Kretschmer,et al. Programmes in Paired Spaces , 1961, Canadian Journal of Mathematics.
[15] Ky Pan. 5. On Systems of Linear Inequalities , 1957 .
[16] R. Rockafellar. Minimax Theorems and Conjugate Saddle-Functions. , 1964 .