Linear Programming: An Introduction to Finite Improvement Algorithms Second Edition

by Solow, Daniel

• ISBN13: 9780486493763
• ISBN10: 0486493768
• eBook ISBN(s): 9780486782171
• Edition: 2nd
• Format: Paperback
• Copyright: 2014-10-15
• Publisher: Dover Publications
• More Book Details
• Purchase Benefits

Summary

Suitable for undergraduate students of mathematics and graduate students of operations research and engineering, this text covers the basic theory and computation for a first course in linear programming. In addition to substantial material on mathematical proof techniques and sophisticated computation methods, the treatment features numerous examples and exercises.
An introductory chapter offers a systematic and organized approach to problem formulation. Subsequent chapters explore geometric motivation, proof techniques, linear algebra and algebraic steps related to the simplex algorithm, standard phase 1 problems, and computational implementation of the simplex algorithm. Additional topics include duality theory, issues of sensitivity and parametric analysis, techniques for handling bound constraints, and network flow problems. Helpful appendixes conclude the text, including a new addition that explains how to use Excel to solve linear programming problems.

Author Biography

Daniel Solow is Professor of Operations at the Weatherhead School of Management, Case Western Reserve University.

Table of Contents

Introduction to the Dover Edition

Preface

Acknowledgments

1. Problem Formulation

2. Geometric Motivation

3. Proof Techniques

4. Linear Algebra

5. The Simplex Algorithm

6. Phase 1

7. Computational Implementation

8. Duality Theory

9. Sinsitivity and Parametric Analysis

10. Techniques for Handling Bound Constraints

11. Network Flow Problems

Appendix A. The Tableau Method

Appendix B. How Efficiently Can We Solve LP Problems?

Appendix C. Spreadsheet Modeling Using Ecxcel

Index