A Comment on "Computational Complexity of Stochastic Programming Problems" 3: An ε-Optimal Decision of the Random-Recourse Program (11) Decides the Integer Feasibility ProblemResearch Paper
A linear two-stage stochastic program chooses a first-stage decision before an uncertain parameter is revealed, and pays the optimal value of a second-stage linear program once the realization is known. Such programs are the basic model of planning under uncertainty in operations research, and their computational complexity…