Für diesen Artikel ist leider kein Bild verfügbar.

Linear Programming and Network Flows

M. S. Bazaraa, John Jeff Jarvis (Autoren)

Buch | Hardcover

704 Seiten

1990 | 2nd Revised edition
John Wiley and Sons (WIE) (Verlag)
9780471636816 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

Thoroughly revised, this text on linear programming introduces new material on the simplex algorithm, polynomially-bounded algorithms and other algorithmic procedures. The book has been designed to provide material for both network flows and linear programming courses.

Thoroughly revised, this leading text on linear programming introduces new material on the simplex algorithm, polynomially- bounded algorithms and other algorithmic procedures. It gives ample consideration to the practical implementation of the simplex algorithm and its extensions, and features excellent coverage of Karmarkar's Algorithm, a new area of considerable research interest. The text contains all the material needed for not only a linear programming course but also a course on network flows.

Linear Algebra, Convex Analysis, and Polyhedral Sets. The Simplex Method. Starting Solution and Convergence. Special Simplex Implementations and Optimality Conditions. Duality and Sensitivity Analysis. The Decomposition Principle. Complexity of the Simplex Algorithm and Polynomial Algorithms. Minimal Cost Network Flows. The Transportation and Assignment Problems. The Out--of--Kilter Algorithm. Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems. Bibliography. Index.

Erscheint lt. Verlag	16.1.1990
Überarbeitung	Hanif D. Sherali
Zusatzinfo	Ill.
Verlagsort	New York
Sprache	englisch
Maße	164 x 243 mm
Gewicht	1049 g
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
ISBN-13	9780471636816 / 9780471636816
Zustand	Neuware