Skip to main content
  • Book
  • Apr 2014

Linear Programming

Foundations and Extensions

Part of the book series: International Series in Operations Research & Management Science (ISOR, volume 37)

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (24 chapters)

  1. Front Matter

    Pages i-xviii
  2. Basic Theory—The Simplex Method and Duality

    1. Front Matter

      Pages 1-2
    2. Introduction

      • Robert J. Vanderbei
      Pages 3-11
    3. The Simplex Method

      • Robert J. Vanderbei
      Pages 13-27
    4. Degeneracy

      • Robert J. Vanderbei
      Pages 29-44
    5. Efficiency of the Simplex Method

      • Robert J. Vanderbei
      Pages 45-54
    6. Duality Theory

      • Robert J. Vanderbei
      Pages 55-87
    7. The Simplex Method in Matrix Notation

      • Robert J. Vanderbei
      Pages 89-109
    8. Sensitivity and Parametric Analyses

      • Robert J. Vanderbei
      Pages 111-124
    9. Implementation Issues

      • Robert J. Vanderbei
      Pages 125-150
    10. Problems in General Form

      • Robert J. Vanderbei
      Pages 151-160
    11. Convex Analysis

      • Robert J. Vanderbei
      Pages 161-171
    12. Game Theory

      • Robert J. Vanderbei
      Pages 173-187
    13. Regression

      • Robert J. Vanderbei
      Pages 189-209
  3. Network-Type Problems

    1. Front Matter

      Pages 211-212
    2. Network Flow Problems

      • Robert J. Vanderbei
      Pages 213-240
    3. Applications

      • Robert J. Vanderbei
      Pages 241-257
    4. Structural Optimization

      • Robert J. Vanderbei
      Pages 259-274
  4. Interior-Point Methods

    1. Front Matter

      Pages 275-276
    2. The Central Path

      • Robert J. Vanderbei
      Pages 277-289

About this book

Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization.

 

The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail.

 

Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied:

-The two-phase simplex method; -The primal-dual simplex method; -The path-following interior-point method; -The homogeneous self-dual methods.

 

In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's webpage: http://www.princeton.edu/-rvdb/LPbook/. Also, check the book's webpage for new online instructional tools and exercises that have been added in the new edition.

 

 

 

Authors and Affiliations

  • Dept. of Operations Research & Financial Engineering, Princeton University, USA

    Robert J. Vanderbei

Bibliographic Information