Table of contents for Linear programming / Katta G. Murty.

Bibliographic record and links to related information available from the Library of Congress catalog

Information from electronic data provided by the publisher. May be incomplete or contain other coding.

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.

Library of Congress subject headings for this publication: Linear programming