CMI Library

Your cart is empty.
Normal view MARC view ISBD view

Linear and nonlinear optimization / Igor Griva, Stephen G. Nash, Ariela Sofer.

By: Griva, Igor.
Contributor(s): Nash, Stephen (Stephen G.) | Sofer, Ariela.
Material type: TextTextPublisher: Philadelphia : Society for Industrial and Applied Mathematics, c2009; Telangana, India.; Universities Press (India) Private Limited. [Distributor] c2018Edition: 2nd ed. indian edition.Description: xxii, 742 p. : ill. ; 24 cm.ISBN: 9789386235374 (pbk.).Subject(s): Linear programming | Nonlinear programmingDDC classification: 519.7/2 Online resources: Contributor biographical information | Publisher description | Table of contents only
Contents:
Optimization models -- Fundamentals of optimization -- Representation of linear constraints -- Geometry of linear programming -- The simplex method -- Duality and sensitivity -- Enhancements of the simplex method -- Network problems -- Computational complexity of linear programming -- Interior-point methods of linear programming -- Basics of unconstrained optimization -- Methods for unconstrained optimization -- Low-storage methods for unconstrained problems -- Optimality conditions for constrained problems -- Feasible-point methods -- Penalty and barrier methods.
List(s) this item appears in: 2021-08-11
Item type Current location Call number Status Date due Barcode Item holds
Book Chennai Mathematical Institute
General Stacks 		519.72 GRI (Browse shelf) Available 10896
Total holds: 0

Gifted by NBHM.

Includes bibliographical references (p. 707-725) and index.

Optimization models -- Fundamentals of optimization -- Representation of linear constraints -- Geometry of linear programming -- The simplex method -- Duality and sensitivity -- Enhancements of the simplex method -- Network problems -- Computational complexity of linear programming -- Interior-point methods of linear programming -- Basics of unconstrained optimization -- Methods for unconstrained optimization -- Low-storage methods for unconstrained problems -- Optimality conditions for constrained problems -- Feasible-point methods -- Penalty and barrier methods.