Oğuz, O.2016-02-082016-02-0820000025-1909http://hdl.handle.net/11693/25025Postoptimality 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.EnglishConvergence of numerical methodsSensitivity analysisPostoptimality analysisWorst case analysisMathematical programmingBounds on the opportunity cost of neglecting reoptimization in mathematical programmingArticle10.1287/mnsc.46.7.1009.12041