Journal
MATHEMATICAL PROGRAMMING
Volume 167, Issue 2, Pages 235-292Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-017-1125-8
Keywords
Robust optimization; Data-driven optimization; Chance-constraints; Hypothesis testing
Categories
Funding
- National Science Foundation [1122374]
Ask authors/readers for more resources
The last decade witnessed an explosion in the availability of data for operations research applications. Motivated by this growing availability, we propose a novel schema for utilizing data to design uncertainty sets for robust optimization using statistical hypothesis tests. The approach is flexible and widely applicable, and robust optimization problems built from our new sets are computationally tractable, both theoretically and practically. Furthermore, optimal solutions to these problems enjoy a strong, finite-sample probabilistic guarantee whenever the constraints and objective function are concave in the uncertainty. We describe concrete procedures for choosing an appropriate set for a given application and applying our approach to multiple uncertain constraints. Computational evidence in portfolio management and queueing confirm that our data-driven sets significantly outperform traditional robust optimization techniques whenever data are available.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available