Linear programming and network flows

著者

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

書誌事項

Linear programming and network flows

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

Wiley, c1990

2nd ed

• : pbk

注記

Bibliography: p. 626-672

Includes index

内容説明・目次

巻冊次

: pbk ISBN 9780471512844

内容説明

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.

目次

• 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.

巻冊次

ISBN 9780471636816

内容説明

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.

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BA10011572
• ISBN:
  • 0471636819
  • 0471512842
• LCCN: 89032063
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: New York
• ページ数/冊数: xiv, 684 p.
• 大きさ: 25 cm
• 分類:
  • LCC : T57.74
  • DC20 : 519.7/2
• 件名:
  • LCSH : Linear programming
  • LCSH : Network analysis (Planning)