zbMATH — the first resource for mathematics

Duality in nonlinear programming and the minimax theorem. (English) Zbl 0152.38104

Full Text: DOI EuDML
[1] Dennis, J. B.: Mathematical Programming and Electrical Networks. Cambridge, Mass.: Technology Press 1959.
[2] Dorn, W. S.: A Duality Theorem for Convex Programs. IBM J. Research and Development4, 407-413 (1960). · Zbl 0095.14503
[3] Fenchel, W.: Convex Cones, Sets, and Functions. Lecture Notes, Department of Mathematics, Princeton University, 1953. · Zbl 0053.12203
[4] Goldman, A. J., andA. W. Tucker: Theory of Linear Programming. In: Linear Inequalities and Related Systems (Annals of Mathematics Studies No.38,H. W. Kuhn andA. W. Tucker (eds.), 53-97. Princeton: Princeton University Press 1956. · Zbl 0072.37601
[5] Hanson, M. A.: A Duality Theorem in Nonlinear Programming with Nonlinear Constraints. Australian J. Statistics3, 63-72 (1961). · Zbl 0102.15601
[6] Huard, P.: Dual Programs. IBM J. Research and Development6, 137-139 (1962). · Zbl 0116.12403
[7] Kakutani, S.: A Generalization of Brouwer’s Fixed Point Theorem. Duke Math. J.8, 457-458 (1941). · Zbl 0061.40304
[8] Karlin, S.: Mathematical Methods and Theory in Games, Programming and Economics, vol. I, p. 201-203. London: Addison Wesley Publ. Company Inc. 1959.
[9] Kuhn, H. W., andA. W. Tucker: Nonlinear Programming. Proc. 2nd Berkeley Symp. on Mathematical Statistics and Probability, 481-492. Berkeley and Los Angeles: University of California Press 1951. · Zbl 0044.05903
[10] Mangasarian, O. L.: Duality in Nonlinear Programming. Quarterly of Appl. Math.20, 300-302 (1962). · Zbl 0113.35703
[11] Wolfe, P.: A Duality Theorem for Non-Linear Programming. Quarterly of Appl. Math.19, 239-244 (1961). · Zbl 0109.38406
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.