Skip to main content

Linear Programming and Network Flows, 3rd Edition

Linear Programming and Network Flows, 3rd Edition

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

ISBN: 978-0-471-70377-8

Aug 2011

704 pages

Select type: O-Book

Description

Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book:
* Provides methods for modeling complex problems via effective algorithms on modern computers.
* Presents the general theory and characteristics of optimization problems, along with effective solution algorithms.
* Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.
One: Introduction.

Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.

Three: The Simplex Method.

Four: Starting Solution and Convergence.

Five: Special Simplex Implementations and Optimality Conditions.

Six: Duality and Sensitivity Analysis.

Seven: The Decomposition Principle.

Eight: Complexity of the Simplex Algorithms.

Nine: Minimal-Cost Network Flows.

Ten: The Transportation and Assignment Problems.

Eleven: The Out-of-Kilter Algorithm.

Twelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems.

Bibliography.

Index.

“I am finding this book useful both for students and other readers interested in this field, welcomed in the operation research literature.” (Zentralbaltt MATH, June 2005)