Nonlinear Programming: Theory and Algorithms

by Mokhtar S. Bazaraa, C.M. Shetty

A comprehensive, rigorous, and self-contained development of the central topics in nonlinear programming. Organized into three major sections: convex analysis, optimality conditions and duality, and algorithms and their convergence. Precise statements of the algorithms are given, along with convergence analysis. Among the topics covered are convex sets and functions, Fritz John and Kuhn Tucker optimality conditions, Lagrangian duality, Saddle Point optimality, constrained and unconstrained optimization, and the development of computational schemes. Includes extensive illustrations, examples, and references.

Genres: Research, Mathematics, Textbooks

560 pages, Hardcover

First published January 18, 1979

Reviews

[Brannon · Rating 2 out of 5]

This book is exceptionally dry. I think the content is good from a collection standpoint, but the whole thing is hard to follow as it lacks a central narrative. It's just theorem after theorem with proofs in between each.

[Aam Amirudin]

i want study about water resources management

[Gita Karmani]

Full of Karush Kuhn Tucker and Fritz John.