 Sampling-Based Stochastic Linear Programming MethodsLewis Ntaimo
Chapter Chapter 8 in Computational Stochastic Programming, 2024, pp 349-386 from Springer Abstract: Abstract In this chapter, we study statistical methods for mean-risk two-stage stochastic linear programs (MR-SLP). We use the theoretical properties of the stochastic programming (SP) models derived in Chap. 2 and decomposition techniques from Chaps. 6 and 7 in the solution methods for MR-SLP. We study two main classical approaches, exterior sampling and interior sampling. Exterior sampling or Monte Carlo methods involve taking a sample and solving an approximation problem, and getting statistical bounds on key solution quantities. In this chapter, we study the basic sample average approximation (SAA) method for MR-SLP. Unlike exterior sampling methods, interior sampling involves sampling during the course of the algorithm. This requires a streamlined design of the algorithm within which sequential sampling is done to solve the approximation problem. We illustrate interior sampling with the basic stochastic decomposition (SD) method for MR-SLP. Since we place emphasis on algorithm computer implementation, we also discuss how to generate random samples from the instance data. Date: 2024 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-52464-6_8 Ordering information: This item can be ordered from DOI: 10.1007/978-3-031-52464-6_8 Access Statistics for this chapter More chapters in Springer Optimization and Its Applications from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.