Bounds on the opportunity cost of neglecting reoptimization in mathematical programming

Date
2000
Authors
Oğuz, O.
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Management Science
Print ISSN
0025-1909
Electronic ISSN
Publisher
INFORMS
Volume
46
Issue
7
Pages
1009 - 1012
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
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.

Course
Other identifiers
Book Title
Keywords
Convergence of numerical methods, Sensitivity analysis, Postoptimality analysis, Worst case analysis, Mathematical programming
Citation
Published Version (Please cite this version)