Show simple item record

dc.contributor.authorCheramin, Meysam
dc.contributor.authorCheng, Jianqiang
dc.contributor.authorJiang, Ruiwei
dc.contributor.authorPan, Kai
dc.date.accessioned2022-08-05T17:43:33Z
dc.date.available2022-08-05T17:43:33Z
dc.date.issued2022-05
dc.identifier.citationCheramin, M., Cheng, J., Jiang, R., & Pan, K. (2022). Computationally Efficient Approximations for Distributionally Robust Optimization under Moment and Wasserstein Ambiguity. INFORMS Journal on Computing, 34(3), 1768–1794.en_US
dc.identifier.issn1091-9856
dc.identifier.doi10.1287/ijoc.2021.1123
dc.identifier.urihttp://hdl.handle.net/10150/665551
dc.description.abstractDistributionally 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.en_US
dc.language.isoenen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.rightsCopyright © 2022, INFORMS.en_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subjectdistributionally robust optimizationen_US
dc.subjectmoment informationen_US
dc.subjectprincipal component analysisen_US
dc.subjectsemidefinite programmingen_US
dc.subjectstochastic programmingen_US
dc.subjectWasserstein distanceen_US
dc.titleComputationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguityen_US
dc.typeArticleen_US
dc.identifier.eissn1526-5528
dc.contributor.departmentDepartment of Systems and Industrial Engineering, University of Arizonaen_US
dc.identifier.journalINFORMS Journal on Computingen_US
dc.description.note12 month embargo; published online: 26 January 2022en_US
dc.description.collectioninformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US
dc.identifier.pii10.1287/ijoc.2021.1123
dc.source.journaltitleINFORMS Journal on Computing
dc.source.volume34
dc.source.issue3
dc.source.beginpage1768
dc.source.endpage1794


Files in this item

Thumbnail
Name:
Final_File_Main_08_01_2021.pdf
Embargo:
2023-01-26
Size:
562.1Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record