Linear Programming and Network Flows - Hardcover

Bazaraa, Mokhtar S.; Jarvis, John J.; Sherali, Hanif D.

Hardcover

ISBN 10: 0471636819 ISBN 13: 9780471636816

Publisher: John Wiley & Sons, 1989

Synopsis

This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides methods for modeling complex problems via effective algorithms on modern computers. The general theory and characteristics of optimization problems are presented, along with effective solution algorithms. The text also explores linear programming and network flows, employing polynomial–time algorithms and various specializations of the simplex method. Includes many numerical examples to illustrate theory and techniques.

About this title

Review

"The book can be used both as reference and as textbook for advanced undergraduate students and first–year graduate students in the fields of industrial engineering, management, operation research, computer science, mathematics and other engineering disciplines that deal with the subjects of linear programming and network flows." (Zentralblatt MATH, 2011)

 

From the Back Cover

The authoritative guide to modeling and solving complex problems with linear programming―extensively revised, expanded, and updated

The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research, computer science, and mathematics.

The book begins with basic results on linear algebra and convex analysis, and a geometrically motivated study of the structure of polyhedral sets is provided. Subsequent chapters include coverage of cycling in the simplex method, interior point methods, and sensitivity and parametric analysis. Newly added topics in the Fourth Edition include:

• The cycling phenomenon in linear programming and the geometry of cycling

• Duality relationships with cycling

• Elaboration on stable factorizations and implementation strategies

• Stabilized column generation and acceleration of Benders and Dantzig–Wolfe decomposition methods

• Line search and dual ascent ideas for the out–of–kilter algorithm

• Heap implementation comments, negative cost circuit insights, and additional convergence analyses for shortest path problems

The authors present concepts and techniques that are illustrated by numerical examples along with insights complete with detailed mathematical analysis and justification. An emphasis is placed on providing geometric viewpoints and economic interpretations as well as strengthening the understanding of the fundamental ideas. Each chapter is accompanied by Notes and References sections that provide historical developments in addition to current and future trends. Updated exercises allow readers to test their comprehension of the presented material, and extensive references provide resources for further study.

Linear Programming and Network Flows, Fourth Edition is an excellent book for linear programming and network flow courses at the upper–undergraduate and graduate levels. It is also a valuable resource for applied scientists who would like to refresh their understanding of linear programming and network flow techniques.

Edition details

• Publisher: John Wiley & Sons
• Publication date: 1989
• ISBN 10: 0471636819
• ISBN 13: 9780471636816
• Binding: Hardcover
• Language: English
• Edition number: 2
• Number of pages: 704