In this paper we consider multiperiod mixed 0–1 linear programming models under uncertainty. We propose a risk averse strategy using stochastic dominance constraints (SDC) induced by mixed-integer linear recourse as the risk measure. The SDC strategy extends the existing literature to the multistage case and includes both first-order and second-order constraints. We propose a stochastic dynamic programming (SDP) solution approach, where one has to overcome the negative impact the cross-scenario constraints, due to SDC, have on the decomposability of the model. In our computational experience we compare our SDP against a commercial optimization package, in terms of solution accuracy and elapsed time. We use supply chain planning instances, where procurement, production, inventory, and distribution decisions need to be made under demand uncertainty. We confirm the hardness of the testbed, where the benchmark cannot find a feasible solution for half of the test instances while we always find one, and show the appealing tradeoff of SDP, in terms of solution accuracy and elapsed time, when solving medium-to-large instances.
|Place of Publication||www|
|Publisher||Mathematical Optimization Society|
|Number of pages||24|
|Publication status||Published - 2014|