A decomposition algorithm for two-stage stochastic programs with approximate rotational invariance

We propose an algorithm of approximating the optimal objective value of a two-stage stochastic program under an assumption of {\it approximate rotational invariance} of the technology matrix, and compare the method with the L-shaped decomposition.