Skip to main content

Linear Programming

Linear Programming

Katta G. Murty

ISBN: 978-0-471-09725-9

Oct 1983

512 pages

Select type: Paperback

In Stock



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.

Buy Both and Save 25%!

This item: Linear Programming

Linear Programming and Network Flows, 4th Edition (Hardcover $149.00)

Original Price:$363.95

Purchased together:$272.96

save $90.99

Cannot be combined with any other offers.

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.