Pragmatic Distributionally Robust Optimization for Simple Integer Recourse Models
- 14 May 2024
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (2) , 1755-1783
Abstract
Inspired by its success for their continuous counterparts, the standard approach to deal with mixed-integer recourse (MIR) models under distributional uncertainty is to use distributionally robust optimization (DRO). We argue, however, that this modeling choice is not always justified since DRO techniques are generally computationally challenging when integer decision variables are involved. That is why we propose an alternative approach for dealing with distributional uncertainty for the special case of simple integer recourse (SIR) models, which is aimed at obtaining models with improved computational tractability. We show that such models can be obtained by pragmatically selecting the uncertainty set. Here, we consider uncertainty sets based on the Wasserstein distance and also on generalized moment conditions. We compare our approach with standard DRO both numerically and theoretically. An important side result of our analysis is the derivation of performance guarantees for convex approximations of SIR models. In contrast to the literature, these error bounds are not only valid for a continuous distribution but hold for any distribution.Keywords
All Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (451-17-034 4043, VI.Vidi.211.066)
- Northwestern University
- Rijksuniversiteit Groningen
- U.S. Department of Homeland Security (17STQAC00001-07-00)
This publication has 29 references indexed in Scilit:
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programsMathematical Programming, 2021
- Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity setsMathematical Programming, 2020
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse modelsMathematical Programming, 2020
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-riskMathematical Programming, 2019
- Distributionally robust simple integer recourseComputational Management Science, 2018
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulationsMathematical Programming, 2017
- Total variation bounds on the expectation of periodic functions with applications to recourse approximationsMathematical Programming, 2014
- Simple integer recourse models: convexity and convex approximationsMathematical Programming, 2006
- Convex approximations for complete integer recourse modelsMathematical Programming, 2004
- Stochastic programming with simple integer recourseMathematical Programming, 1993