Nonlinear Programming

Preface to the Classic Edition; 1. The Nonlinear Programming Problem, Preliminary Concepts, and Notation; 2. Linear Inequalities and Theorems of the Alternative; 3. Convex Sets in Rn; 4. Convex and Concave Functions; 5. Saddlepoint Optimality Criteria in Nonlinear Programming Without Differentiability; 6. Differentiable Convex and Concave Functions; 7. Optimality Criteria in Nonlinear Programming with Differentiability; 8. Duality in Nonlinear Programming; 9. Generalizations of Convex Functions. Quasiconvex, Strictly Quasiconvex, and Pseudoconvex Functions; 10. Optimality and Duality for Generalized Convex and Concave Functions; 11. Optimality and Duality in the Presence of Nonlinear Equality Constraints; Appendix A. Vectors and Matrices; Appendix B. Resume of Some Topological Properties of Rn; Appendix C. Continuous and Semicontinuous Functions, Minima and Infima; Appendix D. Differentiable Functions, Mean-value and Implicit Function Theorems; Bibliography; Name Index; Subject Index.