|
Textbook
Linear ProgrammingISBN: 978-0-471-09725-9
Paperback
512 pages
January 1991, ©1983
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
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.
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.
Related Titles
General Industrial Engineering
Resources for
Instructors
Contact a Wiley Sales Rep
Find Your Rep
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
