Linear Programming and Network Flows
2nd Edition
Published on 16. January 1990
Book
Hardback
704 pages
978-0-471-63681-6 (ISBN)
Description
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.
More details
Edition
2nd Revised edition
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
Ill.
Dimensions
Height: 243 mm
Width: 164 mm
Weight
1049 gr
ISBN-13
978-0-471-63681-6 (9780471636816)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
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.