Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/95746
Title: | Computationally efficient approximations for distributionally robust optimization under moment and Wasserstein ambiguity | Authors: | Cheramin, M Cheng, J Jiang, R Pan, K |
Issue Date: | May-2022 | Source: | Informs journal on computing, May-June 2022, v. 34, no. 3, p. 1768-1794 | Abstract: | Distributionally robust optimization (DRO) is a modeling framework in decision making under uncertainty inwhich the probability distribution of a randomparameter is unknown although its partial information (e.g., statistical properties) is available. In this framework, the unknown probability distribution is assumed to lie in an ambiguity set consisting of all distributions that are compatible with the available partial information. Although DRO bridges the gap between stochastic programming and robust optimization, one of its limitations is that its models for large-scale problems can be significantly difficult to solve, especially when the uncertainty is of high dimension. In this paper, we propose computationally efficient inner and outer approximations for DRO problems under a piecewise linear objective function and with a moment-based ambiguity set and a combined ambiguity set including Wasserstein distance and moment information. In these approximations, we split a random vector into smaller pieces, leading to smaller matrix constraints. In addition, we use principal component analysis to shrink uncertainty space dimensionality. We quantify the quality of the developed approximations by deriving theoretical bounds on their optimality gap. We display the practical applicability of the proposed approximations in a production-transportation problemand a multiproduct newsvendor problem. The results demonstrate that these approximations dramatically reduce the computational time while maintaining high solution quality. The approximations also help construct an interval that is tight for most cases and includes the (unknown) optimal value for a large-scale DRO problem, which usually cannot be solved to optimality (or even feasibility in most cases). Summary of Contribution: This paper studies an important type of optimization problem, that is, distributionally robust optimization problems, by developing computationally efficient inner and outer approximations via operations research tools. Specifically, we consider several variants of such problems that are practically important and that admit tractable yet large-scale reformulation. We accordingly utilize random vector partition and principal component analysis to derive efficient approximations with smaller sizes, which, more importantly, provide a theoretical performance guarantee with respect to low optimality gaps. We verify the significant efficiency (i.e., reducing computational time while maintaining high solution quality) of our proposed approximations in solving both production-transportation and multiproduct newsvendor problems via extensive computing experiments. |
Keywords: | Distributionally robust optimization Moment information Principal component analysis Semidefinite programming Stochastic programming Wasserstein distance |
Publisher: | INFORMS | Journal: | Informs journal on computing | ISSN: | 1091-9856 | EISSN: | 1526-5528 | DOI: | 10.1287/ijoc.2021.1123 | Rights: | © 2022 INFORMS The following publication Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity Meysam Cheramin, Jianqiang Cheng, Ruiwei Jiang, and Kai Pan INFORMS Journal on Computing 2022 34:3, 1768-1794 is available at https://dx.doi.org/10.1287/ijoc.2021.1123 |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Cheramin_Computationally_Wasserstein_Ambiguity.pdf | Pre-Published version | 1.26 MB | Adobe PDF | View/Open |
Page views
66
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
304
Citations as of Oct 13, 2024
SCOPUSTM
Citations
12
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
12
Citations as of Oct 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.