Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming
Postoptimality or sensitivity analysis are well-developed subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of this type of analysis for a specific class of mathematical programming problems. We also show that our bounds are tight.
Volume (Year): 46 (2000)
Issue (Month): 7 (July)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Richard E. Wendell, 1985. "The Tolerance Approach to Sensitivity Analysis in Linear Programming," Management Science, INFORMS, vol. 31(5), pages 564-578, May.
- P. L. Yuf & M. Zeleny, 1976. "Linear Multiparametric Programming by Multicriteria Simplex Method," Management Science, INFORMS, vol. 23(2), pages 159-170, October.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:7:p:1009-1012. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.