Abstract
In contrast to traditional sensitivity analysis in linear programming, the tolerance approach considers simultaneous and independent variations in a number of parameters. A primary focus of this approach is to determine a maximum tolerance percentage for selected right-hand-side terms in which the same basis is optimal as long as each term is accurate to within that percentage of its estimated value. Similarly, the approach yields a maximum tolerance percentage for selected objective function coefficients. This paper shows how the tolerance approach can exploit information on the range of possible values over which terms and coefficients can vary to yield larger maximum tolerance percentages.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.P. Bradley, A.C. Hax and T.L. Magnanti,Applied mathematical programming (Addison-Wesley, Reading, MA, 1977).
J.R. Charnetski, “Linear programming with partial information”,European Journal of Operational Research 5 (1980) 254–261.
G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963).
T. Gal,Postoptimal analyses, parametric programming and related topics (McGraw-Hill, New York, NY, 1979).
T. Gal, “Linear parametric programming—A survey”, Diskussionsbeitrage Nr. 53, Diskussionsbeitrage des Fachbereichs Wirtschaftswissenschaft der Fernuniversitat Hagen, Hagen, West Germany, 1982.
T. Gal and J. Nedoma, “Multiparametric linear programming”,Management Science 18 (1972) 406–422.
F.J. Gould, “Proximate linear programming: An experimental study of a modified simplex algorithm for solving linear programs with inexact data”, Institute of Statistics Mimeo Series No. 789, University of North Carolina at Chapel Hill (Chapel Hill, NC, 1971).
P.G. McKeown and R.A. Minch, “Multiplicative interval variation of objective function coefficients in linear programming”,Management Science 28 (1982) 1462–1470.
K.G. Murty,Linear and combinatorial programming (Wiley, New York, NY, 1976).
R.E. Steuer, “Goal programming sensitivity analysis using interval penalty weights”,Mathematical Programming 17 (1979) 16–31.
R.E. Steuer, “Algorithms for linear programming problems with interval objective function coefficients”,Mathematics of Operations Research 6 (1981) 333–348.
R.E. Wendell, “The tolerance approach to sensitivity analysis in linear programming”,Management Science (to appear).
R.E. Wendell, “Sensitivity analysis revisited and extended: The tolerance approach”, in preparation, Graduate School of Business, University of Pittsburgh (Pittsburgh, PA).
P.L. Yu and M. Zeleny, “Linear multiparametric programming by multicriteria simplex method”,Management Science 23 (1976) 159–170.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wendell, R.E. Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis. Mathematical Programming 29, 304–322 (1984). https://doi.org/10.1007/BF02591999
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591999