×

zbMATH — the first resource for mathematics

Lagrange multipliers and nonlinear programming. (English) Zbl 0154.44803

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Kuhn, H.W; Tucker, A.W, Non-linear programming, () · Zbl 0044.05903
[2] Courant, R; Hilbert, D, ()
[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)
[5] Huard, P, Dual programs, () · Zbl 0116.12403
[6] Rockafellar, R.T, Convex functions and dual extremum problems, () · 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, () · 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, 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 New York · Zbl 0193.19401
[15] Falk, J.E, An algorithm for separable convex programming under linear equality constraints, ()
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.