Linear programming and network flows

Author(s)

Bibliographic Information

Linear programming and network flows

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

Wiley, c1990

2nd ed

  • : pbk

Available at  / 33 libraries

Search this Book/Journal

Note

Bibliography: p. 626-672

Includes index

Description and Table of Contents

Volume

: pbk ISBN 9780471512844

Description

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.

Table of Contents

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

ISBN 9780471636816

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.

Table of Contents

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.

by "Nielsen BookData"

Details

Page Top