Nonlinear programming

1 June 1982

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGMAP Bulletin

No. 31,p. 6-18
https://doi.org/10.1145/1111278.1111279

Abstract

A historical survey of the origins of nonlinear programming is presented with emphasis placed on necessary conditions for optimality. The mathematical sources for the work of Karush, John, Kuhn, and Tucker are traced and compared. Their results are illustrated by duality theorems for nonlinear programs that antedate the modern development of the subject.

Keywords

This publication has 8 references indexed in Scilit:

A note on Fermat's problem
Mathematical Programming, 1973
Hybrid programs: Linear and least-distance
Mathematical Programming, 1971
Convex Analysis
Published by Walter de Gruyter GmbH ,1970
Symposium on Modern Techniques for Extremum Problems—Linear and Nonlinear Programming
Operations Research, 1957
An indirect sufficiency proof for the problem of Lagrange with differential inequalities as added side conditions
Transactions of the American Mathematical Society, 1953
An affine invariant of convex regions
Duke Mathematical Journal, 1938
Normality and abnormality in the calculus of variations
Transactions of the American Mathematical Society, 1938
Systems of Linear Inequalities
Annals of Mathematics, 1919