Linear programming

Author(s)

• Murty, Katta G.

Bibliographic Information

Linear programming

Katta G. Murty

Wiley, c1983

• : est.

Note

Includes bibliographical references and index

Description and Table of Contents

Description

A comprehensive, up-to-date text on linear programming. Covers all practical modeling, mathematical, geometrical, algorithmic, and computational aspects. Surveys recent developments in the field, including the Ellipsoid method. Includes extensive examples and exercises. Designed for advanced undergraduates or graduates majoring in engineering, mathematics, or business administration.

Table of Contents

Formulation of Linear Programs. The Simplex Method. The Geometry of the Simplex Method. Duality in Linear Programming. Revised (Primal) Simplex Method. The Dual Simplex Method. Numerically Stable Forms of the Simplex Method. Parametric Linear Programs. Sensitivity Analysis. Degeneracy in Linear Programming. Bounded-Variable Linear Programs. The Decomposition Principle of Linear Programming. The Transportation Problem. Computational Complexity of the Simplex Algorithm. The Ellipsoid Method. Iterative Methods for Linear Inequalities and Linear Programs. Vector Minima. Index.

by "Nielsen BookData"

Details

• NCID: BA07306545
• ISBN:
  • 047109725X
• LCCN: 83007012
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: New York
• Pages/Volumes: xix, 482 p.
• Size: 25 cm
• Classification:
  • LCC : T57.74
  • DC19 : 519.7/2
• Subject Headings:
  • LCSH : Linear programming