Advertisement

Sensitivity Analysis

  • Nikolaos Ploskas
  • Nikolaos Samaras
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 127)

Abstract

In many cases, after solving an LP problem with the simplex method, there is a change in the data of the LP problem. With sensitivity analysis, we can find if the input data of the LP problem can change without affecting the optimal solution. This chapter discusses how to deal with such changes efficiently. This topic is called sensitivity analysis. Sensitivity analysis is very useful in two situations: (i) when we wish to know how the solution will be affected if we perform a small change in the LP problem, and (ii) when we have already solved an LP problem and we also want to solve a second LP problem in which the data is only slightly different. Rather than restarting the simplex method from scratch for the modified LP problem, we want to solve the modified LP problem starting with the optimal basis of the original LP problem and perform only a few iterations to solve the modified LP problem (if necessary). We examine how the solution of an LP problem is affected when changes are made to the input data of the LP problem. Moreover, we examine changes in: (i) the cost vector, (ii) the right-hand side vector, and (iii) the coefficient of the constraints.

Supplementary material

334954_1_En_12_MOESM1_ESM.zip (6 kb)
chapter 12 (Zip 6 kb)

References

  1. 1.
    Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2011). Linear programming and network flows. Hoboken: John Wiley & Sons.Google Scholar
  2. 2.
    Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization (Vol. 6). Belmont, MA: Athena Scientific.Google Scholar
  3. 3.
    Borgonovo, E., & Plischke, E. (2016). Sensitivity analysis: A review of recent advances. European Journal of Operational Research, 248(3), 869–887.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Vanderbei, R. J. (2015). Linear programming. Heidelberg: Springer.Google Scholar
  5. 5.
    Winston, W. L. (2004). Operations research: Applications and algorithms (Vol. 3). Belmont: Thomson Brooks/Cole.zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Nikolaos Ploskas
    • 1
  • Nikolaos Samaras
    • 1
  1. 1.Department of Applied InformaticsUniversity of MacedoniaThessalonikiGreece

Personalised recommendations