\(L\)-shaped algorithm for two stage problems of stochastic convex programming
The paper studies two stage stochastic convex programming. Feasibility is considered for different cases. Some properties related to optimality cuts are presented. An algorithm based on the discussion of feasibility and optimality is proposed and numerical results for a small example are presented.
scientific article; zbMATH DE number 2064709