A two-stage stochastic convex program with relatively complete recourse in L^∞-space is replaced by a mathematical programming problem in a finite-dimensional space. Using discrete convergence of mappings, conditions are presented that guarantee the convergence of the sequence of solutions of approximate problems to the solution of the initial problem.
No takes yet. Share an insight, caveat, or question.
Riho Lepp (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: