Statistical approximations forstochastic linear programming problems

Julia Higle and Suvrajeet Sen

Annals of Operations Research, 1999, vol. 85, issue 0, 173-193

Abstract: Sampling and decomposition constitute two of the most successful approaches foraddressing large‐scale problems arising in statistics and optimization, respectively. In recentyears, these two approaches have been combined for the solution of large‐scale stochasticlinear programming problems. This paper presents the algorithmic motivation for suchmethods, as well as a broad overview of issues in algorithm design. We discuss both basicschemes as well as computational enhancements and stopping rules. We also introduce ageneralization of current algorithms to handle problems with random recourse. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018917710373 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:85:y:1999:i:0:p:173-193:10.1023/a:1018917710373

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018917710373

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().