Sensitivity Analysis and Uncertainty in Linear Programming

Julia L. Higle () and Stein Wallace
Additional contact information
Julia L. Higle: Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona 85721

Interfaces, 2003, vol. 33, issue 4, 53-60

Abstract: Linear programming (LP) is one of the great successes to emerge from operations research and management science. It is well developed and widely used. LP problems in practice are often based on numerical data that represent rough approximations of quantities that are inherently difficult to estimate. Because of this, most LP-based studies include a postoptimality investigation of how a change in the data changes the solution. Researchers routinely undertake this type of sensitivity analysis (SA), and most commercial packages for solving linear programs include the results of such an analysis as part of the standard output report. SA has shortcomings that run contrary to conventional wisdom. Alternate models address these shortcomings.

Keywords: Philosophy; of; modeling.; Programming:; stochastic. (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.33.4.53.16370 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:33:y:2003:i:4:p:53-60

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().