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...

The nested L-shaped method is used to solve two- and multi-stage linear stochastic programs with recourse, which can have integer variables on the first stage. In this paper we present and evaluate a cut consolidation technique and a dynamic sequencing protocol to accelerate the solution...

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...

Gomory mixed-integer cuts are of crucial importance in solving large-scale mixed-integer linear programs. Recently, there has been considerable research particularly on the strengthening of these cuts. We present a new heuristic algorithm which aims at improving Gomory mixed-integer cuts. Our...

In this paper, we present a multi-stage stochastic programming model that integrates financial hedging decisions into the planning of strategic production networks under uncertain exchange rates and product demands. This model considers the expenses of production plants and the revenues of...