Linear Programming Computation - Info and Reading Options

Open Data:

Intro -- Preface to First Edition -- Acknowledgments -- Preface to Second Edition -- References -- Contents -- About the Book -- About the Author -- Notation -- Part I Foundations -- 1 Introduction -- 1.1 Error of Floating-Point Arithmetic -- 1.2 From Real-Life Issue to LP Model -- 1.3 Illustrative Applications -- 1.4 Standard LP Problem -- 1.5 Basis and Feasible Basic Solution -- References -- 2 Geometry of Feasible Region -- 2.1 Feasible Region as Polyhedral Convex Set -- 2.2 Interior Point and Relative Interior Point -- 2.3 Face, Vertex, and Extreme Direction -- 2.4 Representation of Feasible Region -- 2.5 Optimal Face and Optimal Vertex -- 2.6 Graphic Approach -- 2.7 Heuristic Characteristic of Optimal Solution -- 2.8 Feasible Direction and Active Constraint -- References -- 3 Simplex Method -- 3.1 Simplex Algorithm: Tableau Form -- 3.2 Getting Started -- 3.3 Simplex Algorithm -- 3.4 Degeneracy and Cycling -- 3.5 Finite Pivot Rule -- 3.6 Notes on Simplex Method -- References -- 4 Implementation of Simplex Method -- 4.1 Miscellaneous -- 4.2 Scaling -- 4.3 LU Factorization of Basis -- 4.4 Sparse LU Factorization of Basis -- 4.5 Updating LU Factors -- 4.6 Crash Procedure for Initial Basis -- 4.7 Harris Rule and Tolerance Expending -- 4.8 Pricing for Reduced Cost -- References -- 5 Duality Principle and Dual Simplex Method -- 5.1 Dual LP Problem -- 5.2 Duality Theorem -- 5.3 Optimality Condition -- 5.4 Dual Simplex Algorithm: Tableau Form -- 5.5 Dual Simplex Algorithm -- 5.6 Economic Interpretation of Duality: Shadow Price -- 5.7 Dual Elimination -- 5.8 Bilevel LP: Intercepting Optimal Set -- 5.9 Notes on Duality -- References -- 6 Primal-Dual Simplex Method -- 6.1 Mixed Two-Phase Simplex Algorithm -- 6.2 Primal-Dual Simplex Algorithm -- 6.3 Self-Dual Parametric Simplex Algorithm -- 6.4 Criss-Cross Algorithm Using Most-Obtuse-Angle Rule

Search for “Linear Programming Computation” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Linear Programming Computation” in Libraries Near You:

Read or borrow “Linear Programming Computation” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Linear Programming Computation” at a library near you.