Print this page Share

Linear Programming

ISBN: 978-0-471-09725-9
512 pages
October 1983, ©1983
Linear Programming (047109725X) cover image


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.
See More

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.

See More
Back to Top