Sensitivity and Parametric Analyses

  • Robert J. Vanderbei
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 196)


In this chapter, we consider two related subjects. The first, called sensitivity analysis (or postoptimality analysis) addresses the following question: having found an optimal solution to a given linear programming problem, how much can we change the data and have the current partition into basic and nonbasic variables remain optimal? The second subject addresses situations in which one wishes to solve not just one linear program, but a whole family of problems parametrized by a single real variable.


  1. Borgwardt, K. -H. (1982). The average number of pivot steps required by the simplex-method is polynomial. Zeitschrift für Operations Research, 26, 157–177.Google Scholar
  2. Dantzig, G. (1963). Linear programming and extensions. Princeton: Princeton University Press.CrossRefGoogle Scholar
  3. Gass, S., and Saaty, T. (1955). The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly, 2, 39–45.Google Scholar
  4. Lemke, C. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11, 681–689.CrossRefGoogle Scholar
  5. Nazareth, J. (1986). Homotopy techniques in linear programming. Algorithmica, 1, 529–535.CrossRefGoogle Scholar
  6. Nazareth, J. (1987). Computer solutions of linear programs. Oxford: Oxford University Press.Google Scholar
  7. Smale, S. (1983). On the average number of steps of the simplex method of linear programming. Mathematical Programming, 27, 241–262.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Robert J. Vanderbei
    • 1
  1. 1.Department of Operations Research and Financial EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations