Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Gass, S. & Saaty, T. (1955), ‘The computational algorithm for the parametric objective function’, Naval Research Logistics Quarterly 2, 39–45.
Dantzig, G. (1963), Linear Programming and Extensions, Princeton University Press, Princeton, Princeton.
Lemke, C. (1965), ‘Bimatrix equilibrium points and mathematical programming’, Management Science 11, 681–689.
Smale, S. (1983), ‘On the average number of steps of the simplex method of linear programming’, Mathematical Programming 27, 241–262.
Borgwardt, K.-H. (1982), ‘The average number of pivot steps required by the simplexmethod is polynomial’, Zeitschrift fü Operations Research 26, 157–177.
Nazareth, J. (1986), ‘Homotopy techniques in linear programming’, Algorithmica 1, 529–535.
Nazareth, J. (1987), Computer Solutions of Linear Programs, Oxford University Press, Oxford.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). Sensitivity and Parametric Analyses. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)