{
 "id": "epzx7mjx7x",
 "slug": "two-stage-stochastic-optimization",
 "title": "Two-stage stochastic optimization",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  },
  {
   "id": "physical.math.statistics",
   "label": "Statistics and probability",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math.statistics"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1946.physical.math.statistics",
   "label": "Non-geographic · 1946 to 2000: Statistics and probability",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.statistics",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
    },
    {
     "id": "geo.nongeo.t1946.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
    },
    {
     "id": "geo.nongeo.t1946.physical.math.statistics",
     "label": "Statistics and probability",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math.statistics"
    }
   ]
  }
 ],
 "excerpt": "Two-stage stochastic optimization, also called stage stochastic optimization, is an operations research method splitting decisions into first-stage actions and second-stage recourse after uncertainty is observed.",
 "snippet": "Two-stage stochastic optimization, also called stage stochastic optimization, is an operations research method splitting decisions into first-stage actions and second-stage recourse after uncertainty is observed.",
 "node": "physical.math.statistics",
 "markdown": "# Two-stage stochastic optimization\n\nTwo-stage stochastic optimization is a method of operations research that splits decisions into first-stage actions taken before uncertainty is resolved and second-stage recourse actions taken after the random data are observed, minimizing first-stage cost plus expected recourse cost.\n\n| Key fact | Detail |\n|---|---|\n| Objective | \\( \\min \\; c^{\\top} \\cdot x + \\mathbb{E}[Q(x,\\xi)] \\) subject to \\( A \\cdot x = b,\\ x \\ge 0 \\), where \\( Q(x,\\xi) \\) is the optimal value of the second-stage problem <sup>[1](https://epubs.siam.org/doi/10.1137/1.9780898718751.ch2)</sup> |\n| Decision split | First-stage variables are \"here-and-now\" decisions; second-stage variables are \"wait-and-see\" functions of the observed data <sup>[2](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/4/1470/files/2021/03/SPbook.pdf)</sup> |\n| Matrices | \\( W \\) is the recourse matrix and \\( T \\) the technology matrix; the full scenario-by-scenario problem is the deterministic equivalent, or extensive form <sup>[3](https://canli1.github.io/images/preprint/2021Frontiers.pdf)</sup> |\n| Infeasibility convention | If the second-stage problem is infeasible for some \\( x \\) and \\( \\xi \\), then by definition \\( Q(x,\\xi) = +\\infty \\) <sup>[1](https://epubs.siam.org/doi/10.1137/1.9780898718751.ch2)</sup> |\n| Finite termination | In the linear case the L-shaped method terminates in finitely many steps and yields the optimal solution <sup>[4](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)</sup> |\n| Sample complexity | SAA estimator convergence is \\( O_p(N^{-1/2}) \\); relative accuracy \\( \\nu = 10^{-3} \\) requires sample sizes of order millions <sup>[5](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)</sup> |\n| Hardness barrier | With integer recourse, evaluating the expected second-stage value \\( Q(x) \\) is #P-hard <sup>[6](https://ir.cwi.nl/pub/23271/23271D.pdf)</sup> |\n\n## How it works\n\nThe model assumes the decision maker selects first-stage activities \\( x \\), then observes the random event \\( \\xi \\), and is finally allowed a corrective action \\( y \\) chosen to minimize recourse cost.<sup>[7](https://www.math.ucdavis.edu/~rjbw/mypage/Stochastic_Optimization_files/Wets66_complete.pdf)</sup> Formally, the problem is \\( \\min \\; c^{\\top} \\cdot x + \\mathbb{E}_{\\xi}[Q(x,\\xi)] \\) subject to \\( A \\cdot x = b \\), where \\( Q(x,\\xi) = \\min_y \\{ q^{\\top} \\cdot y \\mid T \\cdot x + W \\cdot y = h,\\ y \\ge 0 \\} \\) and the random vector is \\( \\xi = (q, h, T, W) \\).<sup>[1](https://epubs.siam.org/doi/10.1137/1.9780898718751.ch2)</sup> For discrete distributions with scenarios \\( \\xi_s \\) and probabilities \\( \\pi_s \\), the recourse function is \\( Q(x) = \\sum_s \\pi_s Q(x, \\xi_s) \\).<sup>[8](https://pantuso.sites.ku.dk/files/2023/02/tutorial_stochastic_programming_part1.pdf)</sup>\n\nFeasibility is part of the model: the convention \\( Q(x,\\xi) = +\\infty \\) for infeasible recourse penalizes first-stage decisions that cannot be repaired in some scenarios.<sup>[1](https://epubs.siam.org/doi/10.1137/1.9780898718751.ch2)</sup> A problem has relatively complete recourse when the second-stage problem is feasible for every realization of the data.<sup>[2](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/4/1470/files/2021/03/SPbook.pdf)</sup> The basic modeling assumption is that the probability distribution of the random data is not influenced by the decisions; decision-dependence typically destroys the convex structure the analysis relies on.<sup>[2](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/4/1470/files/2021/03/SPbook.pdf)</sup>\n\n## How it is done\n\n**L-shaped decomposition.** Under relatively complete recourse, each scenario's value function can be written via strong duality as a maximum over dual variables, \\( Q_s(u_0) = \\max_{\\lambda_s} \\{ \\lambda_s \\cdot (h_s - T_s \\cdot u_0) \\mid (W_s)^{\\top} \\cdot \\lambda_s \\le q_s \\} \\), so it is polyhedral.<sup>[4](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)</sup> Optimality cuts are built from an optimal dual solution \\( \\lambda_s^k \\) with \\( \\alpha_s^k := -(T_s)^{\\top} \\cdot \\lambda_s^k \\) and \\( \\beta_s^k := (\\lambda_s^k)^{\\top} \\cdot h_s \\), giving \\( Q_s(u_0) \\ge \\alpha_s^k \\cdot u_0 + \\beta_s^k \\) with equality at the generating point; the master's value is a lower bound and \\( UB = c^{\\top} \\cdot u_0 + \\sum_s \\pi_s Q_s(u_0) \\) an upper bound.<sup>[4](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)</sup> Without relatively complete recourse, feasibility cuts are added: if \\( Q_s(u_0^k) = +\\infty \\) there exists an unbounded dual ray, and admissibility requires \\( \\lambda^k \\cdot (h_s - T_s \\cdot u_0) \\le 0 \\).<sup>[4](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)</sup> In the linear case only finitely many cuts can be added, so the algorithm terminates finitely with the optimal solution.<sup>[4](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)</sup> The same cutting-plane scheme is known in general large-scale optimization as [Benders decomposition](https://www.edgepedia.org/benders-decomposition), and in stochastic programming as the L-shaped algorithm.<sup>[9](https://www.mdpi.com/1999-4893/15/4/103)</sup>\n\n**Sample average approximation.** SAA replaces the expectation with the average over \\( K \\) sampled scenarios, \\( z^K = \\min \\; c^{\\top} \\cdot x + \\frac{1}{K}\\sum_{k=1}^{K} Q(x, \\xi^k) \\); the estimator \\( f^K(\\bar{x}) \\) is unbiased and consistent, with standard deviation \\( \\mathrm{Std}[Q(\\bar{x},\\xi)]/\\sqrt{K} \\).<sup>[8](https://pantuso.sites.ku.dk/files/2023/02/tutorial_stochastic_programming_part1.pdf)</sup> The procedure generates an i.i.d. sample of \\( N \\) realizations, solves the resulting deterministic problem, and repeats until a stopping criterion is met.<sup>[10](http://www.im-uff.mat.br/puc-rio/disciplinas/2006.1/soe/arquivos/kleywegt-shapiro-homem-de-melo-siam-2001.pdf)</sup> \\( \\mathbb{E}[z^K] \\le z^* \\) is a statistical lower bound on the true optimum, while evaluating a candidate solution gives a statistical upper bound; under certain conditions \\( z^K \\to z^* \\) exponentially fast.<sup>[8](https://pantuso.sites.ku.dk/files/2023/02/tutorial_stochastic_programming_part1.pdf)</sup> With probability approaching 1 exponentially fast in \\( N \\), an optimal SAA solution is an exact optimal solution of the true discrete problem.<sup>[10](http://www.im-uff.mat.br/puc-rio/disciplinas/2006.1/soe/arquivos/kleywegt-shapiro-homem-de-melo-siam-2001.pdf)</sup> SAA is not itself an algorithm: once the sample is drawn, the SAA problem is a deterministic program with \\( N \\) equally likely scenarios that still must be solved.<sup>[5](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)</sup>\n\n## Origin\n\nThe field traces to two 1955 papers: George B. Dantzig's \"Linear Programming under Uncertainty\" in Management Science <sup>[11](https://doi.org/10.1287/mnsc.1.3-4.197)</sup> and E. M. L. Beale's \"On Minimizing a Convex Function Subject to Linear Inequalities\" in the Journal of the Royal Statistical Society Series B.<sup>[12](https://doi.org/10.1111/j.2517-6161.1955.tb00191.x)</sup> Surveys describe the field as having its roots in the work of Dantzig and Beale in the 1950s <sup>[13](https://www.math.uwaterloo.ca/~cswamy/papers/FSTTCS-survey.pdf)</sup>, and published accounts write that two-stage stochastic programming with recourse was pioneered by Beale and Dantzig.<sup>[5](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)</sup> Wets also notes the underlying approach of allocating aircraft to routes under uncertain demand.<sup>[7](https://www.math.ucdavis.edu/~rjbw/mypage/Stochastic_Optimization_files/Wets66_complete.pdf)</sup>\n\nThe alternative uncertainty formulation, [chance-constrained programming](https://www.edgepedia.org/chance-constrained-programming), was introduced by A. Charnes and W. W. Cooper in Management Science in 1959 <sup>[14](https://doi.org/10.1287/mnsc.6.1.73)</sup>, with deterministic equivalents for chance constraints following in Operations Research in 1963 <sup>[15](https://doi.org/10.1287/opre.11.1.18)</sup>; Shinji Kataoka's \"A Stochastic Programming Model\" appeared in [Econometrica](https://www.edgepedia.org/econometrica) the same year.<sup>[16](https://doi.org/10.2307/1910956)</sup> Roger Wets's 1966 paper defined the \"complete\" (simple recourse) problem and derived an equivalent convex program with the same optimal solution set.<sup>[17](https://doi.org/10.1007/bf00539117)</sup> David W. Walkup and Roger J.-B. Wets extended the model in 1967 to the general case where \\( c \\), \\( q \\), \\( T \\), \\( W \\), and \\( p \\) are all random, calling it a stochastic program with recourse, and showed its natural equivalent deterministic form is a convex program.<sup>[18](https://doi.org/10.1137/0115113)</sup>\n\n## Variants\n\n**Integer recourse.** When the second-stage variables are integer, the second-stage value function is non-convex and often discontinuous; integer first-stage variables alone, with continuous recourse, do not destroy this convexity.<sup>[19](https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf)</sup> Gilbert Laporte and François V. Louveaux introduced the integer L-shaped method for stochastic integer programs with complete recourse in Operations Research Letters in 1993 <sup>[20](https://doi.org/10.1016/0167-6377%2893%2990002-x)</sup>; for binary first-stage variables it approximates the second-stage value function by cuts that are exact at the generating binary solution and under-estimates elsewhere, requiring second-stage integer problems solved to optimality before a valid cut is produced.<sup>[19](https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf)</sup> Louveaux and Maarten H. van der Vlerk studied stochastic programming with simple integer recourse in Mathematical Programming, also in 1993 <sup>[21](https://doi.org/10.1007/bf01582153)</sup>; simple integer recourse is the integer extension of the continuous simple recourse model, and its expected value function is convex when the distribution of \\( \\omega \\) is a convex combination of uniform distributions with support of integer length.<sup>[22](https://optimization-online.org/wp-content/uploads/2025/11/SMIP_Survey.pdf)</sup> Suvrajeet Sen and Julia L. Higle's D2 algorithm extends Benders-type decomposition to the mixed-integer case by sequentially convexifying the value function.<sup>[23](https://doi.org/10.1007/s10107-004-0566-z)</sup>\n\n**Risk measures.** Replacing the expectation with a risk functional changes structure and algorithms; Rüdiger Schultz and Stephan Tiedemann studied conditional value-at-risk in stochastic programs with mixed-integer recourse in 2005 <sup>[24](https://doi.org/10.1007/s10107-005-0658-4)</sup>, building on the CVaR functional for general loss distributions defined by R. Tyrrell Rockafellar and Stanislav Uryasev.<sup>[25](https://doi.org/10.1016/s0378-4266%2802%2900271-6)</sup>\n\n**Multistage.** Extending to \\( T \\) stages, the number of scenarios an SAA-type procedure needs grows as \\( \\varepsilon^{-2T} \\), so computational effort blows up exponentially in the number of stages.<sup>[5](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)</sup> Scenario generation for multistage problems relies on tree construction <sup>[26](https://doi.org/10.1287/mnsc.47.2.295.9834)</sup>, moment-matching heuristics <sup>[27](https://doi.org/10.1023/a:1021853807313)</sup>, and [scenario reduction](https://www.edgepedia.org/scenario-reduction) algorithms that delete scenarios while controlling a probability-metric distance.<sup>[28](https://doi.org/10.1023/a:1021805924152)</sup>\n\n## Applications\n\nDocumented applications include process networks, where under the minimization convention the value of the stochastic solution is computed as \\( \\mathrm{VSS} = EEV - RP \\), so it is nonnegative.<sup>[3](https://canli1.github.io/images/preprint/2021Frontiers.pdf)</sup> Two-stage stochastic integer models are applied in energy planning, including stochastic thermal unit commitment in power production planning <sup>[29](https://www.gams.com/~svigerske/publications/RoemVigPSH.pdf)</sup>, and in manufacturing and logistics.<sup>[19](https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf)</sup> [Stochastic](https://www.edgepedia.org/stochastic) routing problems (shortest paths with random travel times or arc failures, and stochastic tours) form a further class; in one SAA study, instances with up to \\( 2^{1694} \\) scenarios were solved to within an estimated 1.0% of optimality, and because the average number of cuts does not grow with the sample size, running time grows only linearly in \\( N \\).<sup>[30](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/8/1346/files/2020/09/StochRouting.pdf)</sup>\n\n## Limitations and alternatives\n\n**Integer recourse.** Because the value function of an integer program is non-convex and often discontinuous, the expected second-stage cost is non-convex in \\( x \\); with a continuous distribution, evaluating it requires integrating the value function of an integer program, which is in general impossible.<sup>[19](https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf)</sup> Evaluating \\( Q(x) \\) for fixed \\( x \\) is #P-hard, and two-stage stochastic programming with continuously distributed parameters is #P-hard.<sup>[6](https://ir.cwi.nl/pub/23271/23271D.pdf)</sup> Classical Benders and Lagrangean decomposition cannot solve integer recourse problems to optimality in their classical forms, and Lagrangean decomposition is not guaranteed to converge even with continuous recourse, usually leaving a duality gap.<sup>[3](https://canli1.github.io/images/preprint/2021Frontiers.pdf)</sup>\n\n**Infeasible recourse and sampling.** Without relatively complete recourse, SAA solutions can be infeasible for unseen scenarios; the probability that a solution's recourse likelihood \\( \\phi(x) = \\mathbb{P}(F(x,\\xi) < \\infty) \\) falls below \\( 1-\\varepsilon \\) converges to zero exponentially fast with the sample size.<sup>[31](https://ar5iv.labs.arxiv.org/html/1912.13078)</sup> Scenario discretization introduces bias, mitigated by scenario reduction that bounds the change in the optimal value by \\( |z(P) - z(Q)| \\le L \\, d(P,Q) \\).<sup>[8](https://pantuso.sites.ku.dk/files/2023/02/tutorial_stochastic_programming_part1.pdf)</sup> The classical sample-size bound is quadratic in the inverse relative accuracy \\( 1/\\nu \\): solving to \\( \\nu = 10\\% \\) or \\( 1\\% \\) is feasible even with astronomically many scenarios, but \\( \\nu = 10^{-3} \\) requires samples of order millions and \\( \\nu = 10^{-5} \\) of order tens of billions.<sup>[5](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)</sup>\n\n**Alternatives.** [Stochastic programming](https://www.edgepedia.org/stochastic-programming) is risk-neutral, optimizing the expected outcome, whereas chance-constrained programming and robust optimization differ in degree of risk aversion and characterization of uncertainty.<sup>[3](https://canli1.github.io/images/preprint/2021Frontiers.pdf)</sup> A comparison on large-scale unit-commitment instances found robust optimization computationally least costly but difficult to parameterize and with the highest recourse cost, while two-stage approaches did poorly in robustness because recourse decisions compensate; their total computational cost was highest, suggesting two-stage flexibility and robustness can be practically orthogonal concepts.<sup>[32](https://ideas.repec.org/a/spr/eurjco/v5y2017i1d10.1007_s13675-015-0051-x.html)</sup>\n\n## References\n\n1. [Lectures on Stochastic Programming, Ch. 2: Two-Stage Problems (Shapiro, Dentcheva, Ruszczyński)](https://epubs.siam.org/doi/10.1137/1.9780898718751.ch2)\n2. [Shapiro, Dentcheva, Ruszczyński, Lectures on Stochastic Programming (book preface/intro PDF)](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/4/1470/files/2021/03/SPbook.pdf)\n3. [A Review of Stochastic Programming Methods for Optimization of Process Systems under Uncertainty (2021)](https://canli1.github.io/images/preprint/2021Frontiers.pdf)\n4. [V. Leclère, 'The L-Shaped Method' (Cermics, Ecole des Ponts ParisTech, 2019)](http://cermics.enpc.fr/~delara/TEACHING/slides_l-shaped.pdf)\n5. [On complexity of stochastic programming problems (Shapiro, Optimization Online 2004)](https://optimization-online.org/wp-content/uploads/2004/10/978.pdf)\n6. [Approximation in two-stage stochastic integer programming (CWI)](https://ir.cwi.nl/pub/23271/23271D.pdf)\n7. [R. Wets, 'Programming Under Uncertainty: The Complete Problem' (1966)](https://www.math.ucdavis.edu/~rjbw/mypage/Stochastic_Optimization_files/Wets66_complete.pdf)\n8. [Pantuso, 'Stochastic Programming: A tutorial – Part I'](https://pantuso.sites.ku.dk/files/2023/02/tutorial_stochastic_programming_part1.pdf)\n9. [A Review on the Performance of Linear and Mixed Integer Two-Stage Stochastic Programming Software (Algorithms, 2022)](https://www.mdpi.com/1999-4893/15/4/103)\n10. [The Sample Average Approximation Method for Stochastic Discrete Optimization (Kleywegt, Shapiro, Homem-de-Mello, SIAM J. Optimization 12(2):479-502, 2002)](http://www.im-uff.mat.br/puc-rio/disciplinas/2006.1/soe/arquivos/kleywegt-shapiro-homem-de-melo-siam-2001.pdf)\n11. [George B. Dantzig (1955). Linear Programming under Uncertainty. Management Science.](https://doi.org/10.1287/mnsc.1.3-4.197)\n12. [E. M. L. Beale (1955). On Minimizing a Convex Function Subject to Linear Inequalities. Journal of the Royal Statistical Society Series B (Statistical Methodology).](https://doi.org/10.1111/j.2517-6161.1955.tb00191.x)\n13. [Approximation Algorithms for 2-Stage Stochastic Optimization Problems (LNCS 4337 survey)](https://www.math.uwaterloo.ca/~cswamy/papers/FSTTCS-survey.pdf)\n14. [A. Charnes, W. W. Cooper (1959). Chance-Constrained Programming. Management Science.](https://doi.org/10.1287/mnsc.6.1.73)\n15. [A. Charnes, W. W. Cooper (1963). Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints. Operations Research.](https://doi.org/10.1287/opre.11.1.18)\n16. [Shinji Kataoka (1963). A Stochastic Programming Model. Econometrica.](https://doi.org/10.2307/1910956)\n17. [Roger Wets (1966). Programming under uncertainty: The complete problem. Probability Theory and Related Fields.](https://doi.org/10.1007/bf00539117)\n18. [David W. Walkup, Roger J.-B. Wets (1967). Stochastic Programs with Recourse. SIAM Journal on Applied Mathematics.](https://doi.org/10.1137/0115113)\n19. [Two-Stage Stochastic Integer Programming: A Brief Introduction (Shabbir Ahmed, Wiley Encyclopedia of OR/MS)](https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf)\n20. [The integer L-shaped method for stochastic integer programs with complete recourse (Operations Research Letters, 1993)](https://doi.org/10.1016/0167-6377%2893%2990002-x)\n21. [François V. Louveaux, Maarten H. van der Vlerk (1993). Stochastic programming with simple integer recourse. Mathematical Programming.](https://doi.org/10.1007/bf01582153)\n22. [Stochastic Mixed-Integer Programming: A Survey (Romeijnders, Zhang, Sen, 2025 preprint)](https://optimization-online.org/wp-content/uploads/2025/11/SMIP_Survey.pdf)\n23. [Suvrajeet Sen, Julia L. Higle (2005). The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification. Mathematical Programming.](https://doi.org/10.1007/s10107-004-0566-z)\n24. [Rüdiger Schultz, Stephan Tiedemann (2005). Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse. Mathematical Programming.](https://doi.org/10.1007/s10107-005-0658-4)\n25. [Conditional value-at-risk for general loss distributions (Journal of Banking & Finance, 2002)](https://doi.org/10.1016/s0378-4266%2802%2900271-6)\n26. [Kjetil Høyland, Stein W. Wallace (2001). Generating Scenario Trees for Multistage Decision Problems. Management Science.](https://doi.org/10.1287/mnsc.47.2.295.9834)\n27. [Kjetil Høyland, Michal Kaut, Stein W. Wallace (2003). A Heuristic for Moment-Matching Scenario Generation. Computational Optimization and Applications.](https://doi.org/10.1023/a:1021853807313)\n28. [Holger Heitsch, Werner Römisch (2003). Scenario Reduction Algorithms in Stochastic Programming. Computational Optimization and Applications.](https://doi.org/10.1023/a:1021805924152)\n29. [Recent progress in two-stage mixed-integer stochastic programming with applications to power production planning](https://www.gams.com/~svigerske/publications/RoemVigPSH.pdf)\n30. [The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study (Verweij, Ahmed, Kleywegt, Nemhauser, Shapiro)](https://bpb-us-e1.wpmucdn.com/sites.gatech.edu/dist/8/1346/files/2020/09/StochRouting.pdf)\n31. [On sample average approximation for two-stage stochastic programs without relatively complete recourse (arXiv 1912.13078)](https://ar5iv.labs.arxiv.org/html/1912.13078)\n32. [A comparison of four approaches from stochastic programming for large-scale unit-commitment (Computational Management Science, 2017)](https://ideas.repec.org/a/spr/eurjco/v5y2017i1d10.1007_s13675-015-0051-x.html)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics › Statistics and probability*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [
  "https://www.math.ucdavis.edu/~rjbw/mypage/Stochastic_Optimization_files/Wets66_complete.pdf",
  "https://www2.isye.gatech.edu/~sahmed/eorms_sip.pdf"
 ],
 "url": "https://www.edgepedia.org/two-stage-stochastic-optimization",
 "markdown_url": "https://www.edgepedia.org/two-stage-stochastic-optimization.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Two-stage stochastic optimization\", Edgepedia (EdgeChat), https://www.edgepedia.org/two-stage-stochastic-optimization. Edgepedia Community License 1.0.",
 "credit_md": "\"[Two-stage stochastic optimization](https://www.edgepedia.org/two-stage-stochastic-optimization)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/two-stage-stochastic-optimization](https://www.edgepedia.org/two-stage-stochastic-optimization). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/two-stage-stochastic-optimization\">Two-stage stochastic optimization</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/two-stage-stochastic-optimization\">https://www.edgepedia.org/two-stage-stochastic-optimization</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Two-stage stochastic optimization, also called stage stochastic optimization, is an operations research method splitting decisions into first-stage actions and second-stage recourse after uncertainty is observed."
}