Accelerating the regularized decomposition method for two stage stochastic linear problems

Practical improvements of the regularized decomposition algorithm for two stage stochastic problems are presented. They are associated with the primal simplex method for solving subproblems. A penalty formulation of the subproblems is used, which facilitates crash and warm starts, and allows more freedom when creating the model. The computational results are highly encouraging