Skip to main content
Top
Published in:
Cover of the book

2014 | OriginalPaper | Chapter

7. Sensitivity and Parametric Analyses

Author : Robert J. Vanderbei

Published in: Linear Programming

Publisher: Springer US

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
In the first edition, this method was called the primal–dual simplex method.
 
Literature
go back to reference 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. 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.
go back to reference Dantzig, G. (1963). Linear programming and extensions. Princeton: Princeton University Press.CrossRef Dantzig, G. (1963). Linear programming and extensions. Princeton: Princeton University Press.CrossRef
go back to reference Gass, S., and Saaty, T. (1955). The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly, 2, 39–45. Gass, S., and Saaty, T. (1955). The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly, 2, 39–45.
go back to reference Lemke, C. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11, 681–689.CrossRef Lemke, C. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11, 681–689.CrossRef
go back to reference Nazareth, J. (1986). Homotopy techniques in linear programming. Algorithmica, 1, 529–535.CrossRef Nazareth, J. (1986). Homotopy techniques in linear programming. Algorithmica, 1, 529–535.CrossRef
go back to reference Nazareth, J. (1987). Computer solutions of linear programs. Oxford: Oxford University Press. Nazareth, J. (1987). Computer solutions of linear programs. Oxford: Oxford University Press.
go back to reference Smale, S. (1983). On the average number of steps of the simplex method of linear programming. Mathematical Programming, 27, 241–262.CrossRef Smale, S. (1983). On the average number of steps of the simplex method of linear programming. Mathematical Programming, 27, 241–262.CrossRef
Metadata
Title
Sensitivity and Parametric Analyses
Author
Robert J. Vanderbei
Copyright Year
2014
Publisher
Springer US
DOI
https://doi.org/10.1007/978-1-4614-7630-6_7