Two-Stage Stochastic Programs: Here-and-Now vs. Wait-and-See

Introduces the two-stage stochastic programming framework. Defines first-stage (here-and-now) decisions made before uncertainty is revealed and second-stage (recourse) costs. Distinguishes the recourse problem RP from the wait-and-see value WS, and computes the expected value of perfect information EVPI = RP - WS.

Step 1 of 157%

Tutorial

The Two-Stage Structure

A two-stage stochastic program splits a decision problem into two stages separated by the revelation of uncertainty.

  1. First stage (here-and-now). The decision xx must be chosen before the random scenario is observed. We are committed to xx no matter what happens next.

  2. Second stage (recourse). A scenario sS={s1,s2,,sK}s\in S=\{s_1,s_2,\ldots,s_K\} is realized with probability psp_s. Given xx and ss, the total cost incurred is q(x,s)q(x,s).

The expected total cost of committing to first-stage decision xx is the probability-weighted sum of scenario costs:

Es[q(x,s)]=sSpsq(x,s).\mathbb{E}_s[q(x,s)]=\sum_{s\in S} p_s\cdot q(x,s).

For example, suppose demand is Low (p=0.3p=0.3) or High (p=0.7p=0.7), and producing x=150x=150 units yields q(150,Low)=80q(150,\text{Low})=80 and q(150,High)=50.q(150,\text{High})=50. Then

Es[q(150,s)]=0.380+0.750=24+35=59.\mathbb{E}_s[q(150,s)]=0.3\cdot 80+0.7\cdot 50=24+35=59.
navigate · Enter open · Esc close · ⌘K/Ctrl K toggle