An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem

Jonathan F. Bard
Additional contact information
Jonathan F. Bard: Northeastern University, Boston, Massachusetts

Operations Research, 1983, vol. 31, issue 4, 670-684

Abstract: This paper presents an algorithm using sensitivity analysis to solve a linear two-stage optimization problem. The underlying theory rests on a set of first order optimality conditions that parallel the Kuhn-Tucker conditions associated with a one-dimensional parametric linear program. The solution to the original problem is uncovered by systematically varying the parameter over the unit interval and solving the corresponding linear program. Finite convergence is established under nondegenerate assumptions. The paper also discusses other solution techniques including branch and bound and vertex enumeration and gives an example highlighting their computational and storage requirements. By these measures, the algorithm presented here has an overall advantage. Finally, a comparison is drawn between bicriteria and bilevel programming, and underscored by way of an example.

Keywords: 639 efficient points; 641 two-stage optimization (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.4.670 (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:oropre:v:31:y:1983:i:4:p:670-684

Access Statistics for this article

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