Sensitivity and Parametric Analyses
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.
- 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
- Gass, S., and Saaty, T. (1955). The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly, 2, 39–45.Google Scholar
- Nazareth, J. (1987). Computer solutions of linear programs. Oxford: Oxford University Press.Google Scholar