Linear Programming and Network Flows
3rd Edition
Published on 1. December 2004
Book
Hardback
744 pages
978-0-471-48599-5 (ISBN)
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.
Reviews / Votes
"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)More details
Edition
3., Auflage
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Edition type
Revised edition
Illustrations
Illustrations
Dimensions
Height: 23.7 cm
Width: 16 cm
Thickness: 38 mm
Weight
1134 gr
ISBN-13
978-0-471-48599-5 (9780471485995)
Schweitzer Classification
Other editions
New editions
Mokhtar S. Bazaraa | John J. Jarvis | Hanif D. Sherali
Linear Programming and Network Flows
Book
01/2010
4th Edition
Wiley
€147.50
Shipment within 10-20 days
Persons
MOKHTAR S. BAZARAA, PhD, is Managing Director for Global Logistics, The Logistics Institute, at Georgia Institute of Technology. He, along with Dr. Sherali, are coauthors of Nonlinear Programming: Theory and Algorithms (Wiley).
JOHN J. JARVIS, PhD, is Professor Emeritus at Georgia Institute of Technology.
HANIF D. SHERALI, PhD, is a W. Thomas Rice Chaired Professor of Engineering in the Grado Department of Industrial and Systems Engineering at Virginia Polytechnic and State University.
Content
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.