Linear Programming

Foundations and Extensions

Authors:

ISBN: 978-1-4614-7629-0 (Print) 978-1-4614-7630-6 (Online)
Download Book (7,238 KB) As a courtesy to our readers the eBook is provided DRM-free. However, please note that Springer uses effective methods and state-of-the art technology to detect, stop, and prosecute illegal sharing to safeguard our authors’ interests.

Table of contents (25 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xxii

  2. Basic Theory: The Simplex Method and Duality

    1. Front Matter

      Pages 1-2

    2. Book Chapter

      Pages 3-9

      Introduction

    3. Book Chapter

      Pages 11-23

      The Simplex Method

    4. Book Chapter

      Pages 25-37

      Degeneracy

    5. Book Chapter

      Pages 39-52

      Efficiency of the Simplex Method

    6. Book Chapter

      Pages 53-79

      Duality Theory

    7. Book Chapter

      Pages 81-97

      The Simplex Method in Matrix Notation

    8. Book Chapter

      Pages 99-109

      Sensitivity and Parametric Analyses

    9. Book Chapter

      Pages 111-132

      Implementation Issues

    10. Book Chapter

      Pages 133-140

      Problems in General Form

    11. Book Chapter

      Pages 141-150

      Convex Analysis

    12. Book Chapter

      Pages 151-163

      Game Theory

    13. Book Chapter

      Pages 165-184

      Regression

    14. Book Chapter

      Pages 185-195

      Financial Applications

  3. Network-Type Problems

    1. Front Matter

      Pages 197-198

    2. Book Chapter

      Pages 199-224

      Network Flow Problems

    3. Book Chapter

      Pages 225-239

      Applications

    4. Book Chapter

      Pages 241-254

      Structural Optimization

  4. Interior-Point Methods

    1. Front Matter

      Pages 255-256

    2. Book Chapter

      Pages 257-268

      The Central Path

    3. Book Chapter

      Pages 269-283

      A Path-Following Method

    4. Book Chapter

      Pages 285-291

      The KKT System

    5. Book Chapter

      Pages 293-307

      Implementation Issues for Interior-Point Methods

previous Page of 2