Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Linear Programming and Network Flows - MS Bazaraa

Linear Programming and Network Flows

(Autor)

Buch | Hardcover
744 Seiten
2004 | 3rd Revised edition
John Wiley & Sons Inc (Verlag)
978-0-471-48599-5 (ISBN)
CHF 156,65 inkl. MwSt
zur Neuauflage
  • Titel erscheint in neuer Auflage
  • Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Now in its third, comprehensively updated edition, this esteemed text addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. The book addresses the practical aspects of building LP models, solving them on computer, and interpreting LP solutions.
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.

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.

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.

Erscheint lt. Verlag 18.1.2005
Zusatzinfo Illustrations
Verlagsort New York
Sprache englisch
Maße 160 x 237 mm
Gewicht 1134 g
Einbandart gebunden
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Finanz- / Wirtschaftsmathematik
ISBN-10 0-471-48599-3 / 0471485993
ISBN-13 978-0-471-48599-5 / 9780471485995
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90