Traditionally, two variants of the L-shaped method based on Benders’ decomposition principle are used to solve two-stage stochastic programming problems: the aggregate and the disaggregate version. In this study we report our experiments with a special convex programming method applied to the...

We show that the simplex method can be interpreted as a cutting-plane method, assuming that a special pricing rule is used. This approach is motivated by the recent success of the cutting-plane method in the solution of special stochastic programming problems. We focus on the special linear...

Based on the polyhedral representation of Künzi-Bay and Mayer [Künzi-Bay, A., Mayer, J., 2006. Computational aspects of minimizing conditional value-at-risk. Computational Management Science 3, 3-27] , we propose decomposition frameworks for handling CVaR objectives and constraints in...