Bounds on the opportunity cost of neglecting reoptimization in mathematical programming
Author(s)
Date
2000Source Title
Management Science
Print ISSN
0025-1909
Publisher
INFORMS
Volume
46
Issue
7
Pages
1009 - 1012
Language
English
Type
ArticleItem Usage Stats
213
views
views
214
downloads
downloads
Abstract
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.
Keywords
Convergence of numerical methodsSensitivity analysis
Postoptimality analysis
Worst case analysis
Mathematical programming