×

Lagrange multipliers and nonlinear programming. (English) Zbl 0154.44803


PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Kuhn, H. W.; Tucker, A. W., Non-linear programming, (Neyman, J., Proceedings of the Second Berkeley Symposium of Mathematical Statistics and Probability (1951), University of California Press) · Zbl 0044.05903
[2] Courant, R.; Hilbert, D., (Methods of Mathematical Physics, Vol. 1 (1953), Wiley (Interscience): Wiley (Interscience) New York) · Zbl 0729.00007
[3] Dorn, W. S., A duality theorem for convex programs, IBM J. Res. Dev., 4 (1960) · Zbl 0095.14503
[4] Wolfe, P., A duality theorem for nonlinear programming, Quart. Appl. Math., 19 (1961) · Zbl 0109.38406
[5] Huard, P., Dual programs, (Graves, R. L.; Wolfe, P., Recent Advances in Mathematical Programming (1963), McGraw-Hill: McGraw-Hill New York) · Zbl 0116.12403
[6] Rockafellar, R. T., Convex functions and dual extremum problems, (Doctoral dissertation (1963), Harvard University) · Zbl 0154.44902
[7] Whinston, A., Conjugate functions and symmetric duality, Cowles Foundation Discussion Paper, No. 162 (November, 1963)
[8] Everett, H., Generalized LaGrange multiplier method for solving problems of optimal allocation of resources, Operations Res., 11 (1963) · Zbl 0113.14202
[9] Takahashi, I., Variable separation principle for mathematical programming, J. Operations Res. Soc. Japan, 6 (1964)
[10] Falk, J. E., A constrained Lagrangian approach to nonlinear programming, (Doctoral dissertation (May 1965), University of Michigan) · Zbl 0167.18303
[11] Lemke, C. E., A method of solution for quadratic programming, Management Sci., 8 (1962) · Zbl 0995.90611
[12] Fenchel, W., Convex Cones, Sets and Functions (1953), Princeton University Press: Princeton University Press Princeton, New Jersey · Zbl 0053.12203
[13] Fiacco, A. V.; McCormick, G. P., The sequential unconstrained minimization technique for nonlinear programming, a primal-dual method, Management Sci., 10 (1964) · Zbl 0193.18805
[14] Dreyfus, S. E., Dynamic Programming and the Calculus of Variations (1965), Academic Press: Academic Press New York · Zbl 0193.19401
[15] Falk, J. E., An algorithm for separable convex programming under linear equality constraints, (RAC-TP-148 (March, 1965), Research Analysis Corporation)
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.