Stochastic Linear Programming: Models, Theory, and Computation I: a saddle point of the Lagrangian of a convex program solves both the primal and the dual problemTextbook
Kall and Mayer's Stochastic Linear Programming: Models, Theory, and Computation (Kluwer/Springer, 2005) reduces most stochastic models to deterministic optimization problems. Chance-constrained problems become nonlinear programs with convex constraint functions, and the regularized decomposition methods for recourse problems solve a quadratic master program…