A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem

A. Haurie, G. Savard and D. J. White
Additional contact information
A. Haurie: École des Hautes Études Commerciales, Montreal, Canada
G. Savard: College Militaire Royal, St. Jean, Quebec, Canada
D. J. White: University of Virginia, Charlottesville, Virginia

Operations Research, 1990, vol. 38, issue 3, 553-555

Abstract: The efficient point algorithm proposed by J. F. Bard for the computation of the solution of the Linear Two-Stage Optimization Problem does not always converge to the desired solution. A counterexample is provided and the reasons for this lack of convergence are discussed.

Keywords: programming:; nonlinear (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.3.553 (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:38:y:1990:i:3:p:553-555

Access Statistics for this article

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