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...

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 46; no. 7; pp. 1009 - 1012
Main Author Oguz, Osman
Format Journal Article
LanguageEnglish
Published Linthicum INFORMS 01.07.2000
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
Coefficients
Linear programming
Mathematical intervals
Mathematical programming
Nonlinear programming
Objective functions
Opportunity costs
Optimal solutions
Optimization
Sensitivity analysis
Studies
tolerance limits
Variable coefficients
worst-case Analysis
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.46.7.1009.12041