Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Linear Programming : Foundations and Extensions /

By: Vanderbei, Robert J [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: International Series in Operations Research & Management Science: 114Publisher: Boston, MA : Springer US, 2008.Edition: 3.Description: XX, 468 p. 82 illus., 16 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387743882.Subject(s): Mathematics | Operations research | Decision making | Mathematical models | Mathematical optimization | Management science | Industrial engineering | Production engineering | Engineering economics | Engineering economy | Mathematics | Operations Research, Management Science | Operation Research/Decision Theory | Optimization | Mathematical Modeling and Industrial Mathematics | Engineering Economics, Organization, Logistics, Marketing | Industrial and Production EngineeringDDC classification: 519.6 Online resources: Click here to access online
Contents:
Basic Theory—The Simplex Method and Duality -- The Simplex Method -- Degeneracy -- Efficiency of the Simplex Method -- Duality Theory -- The Simplex Method in Matrix Notation -- Sensitivity and Parametric Analyses -- Implementation Issues -- Problems in General Form -- Convex Analysis -- Game Theory -- Regression -- Financial Applications -- Network-Type Problems -- Network Flow Problems -- Applications -- Structural Optimization -- Interior-Point Methods -- The Central Path -- A Path-Following Method -- The KKT System -- Implementation Issues -- The Affine-Scaling Method -- The Homogeneous Self-Dual Method -- Extensions -- Integer Programming -- Quadratic Programming -- Convex Programming.
In: Springer eBooksSummary: Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail. Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied: The two-phase simplex method; The primal-dual simplex method; The path-following interior-point method; The homogeneous self-dual methods. In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's webpage: http://www.princeton.edu/-rvdb/LPbook/. Also, check the book's webpage for new online instructional tools and exercises that have been added in the new edition.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK10239
Total holds: 0

Basic Theory—The Simplex Method and Duality -- The Simplex Method -- Degeneracy -- Efficiency of the Simplex Method -- Duality Theory -- The Simplex Method in Matrix Notation -- Sensitivity and Parametric Analyses -- Implementation Issues -- Problems in General Form -- Convex Analysis -- Game Theory -- Regression -- Financial Applications -- Network-Type Problems -- Network Flow Problems -- Applications -- Structural Optimization -- Interior-Point Methods -- The Central Path -- A Path-Following Method -- The KKT System -- Implementation Issues -- The Affine-Scaling Method -- The Homogeneous Self-Dual Method -- Extensions -- Integer Programming -- Quadratic Programming -- Convex Programming.

Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail. Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied: The two-phase simplex method; The primal-dual simplex method; The path-following interior-point method; The homogeneous self-dual methods. In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's webpage: http://www.princeton.edu/-rvdb/LPbook/. Also, check the book's webpage for new online instructional tools and exercises that have been added in the new edition.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha