Using bounds on the data in linear programming: the tolerance approach to sensitivity analysis

作者: Richard E. Wendell

DOI: 10.1007/BF02591999

关键词:

摘要: In contrast to traditional sensitivity analysis in linear programming, the tolerance approach considers simultaneous and independent variations a number of parameters. A primary focus this is determine maximum percentage for selected right-hand-side terms which same basis optimal as long each term accurate within that its estimated value. Similarly, yields objective function coefficients. This paper shows how can exploit information on range possible values over coefficients vary yield larger percentages.

参考文章(12)
Thomas L. Magnanti, Stephen P. Bradley, Arnoldo C. Hax, Applied Mathematical Programming ,(1977)
Patrick G. McKeown, Roland A. Minch, Note—Multiplicative Interval Variation of Objective Function Coefficients in Linear Programming Management Science. ,vol. 28, pp. 1462- 1470 ,(1982) , 10.1287/MNSC.28.12.1462
Richard E. Wendell, The Tolerance Approach to Sensitivity Analysis in Linear Programming Management Science. ,vol. 31, pp. 564- 578 ,(1985) , 10.1287/MNSC.31.5.564
Johnnie R. Charnetski, Linear programming with partial information European Journal of Operational Research. ,vol. 5, pp. 254- 261 ,(1980) , 10.1016/0377-2217(80)90057-0
Ralph E. Steuer, Goal programming sensitivity analysis using interval penalty weights Mathematical Programming. ,vol. 17, pp. 16- 31 ,(1979) , 10.1007/BF01588223
Tomas Gal, Josef Nedoma, Multiparametric Linear Programming Management Science. ,vol. 18, pp. 406- 422 ,(1972) , 10.1287/MNSC.18.7.406
Ralph E. Steuer, Algorithms for Linear Programming Problems with Interval Objective Function Coefficients Mathematics of Operations Research. ,vol. 6, pp. 333- 348 ,(1981) , 10.1287/MOOR.6.3.333
George Bernard Dantzig, Linear Programming and Extensions ,(1963)