Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
1009 - 1012
Item Usage Stats
MetadataShow full item record
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.
KeywordsConvergence of numerical methods
Worst case analysis