Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets
Haolin Ruan (),
Zhi Chen () and
Chin Pang Ho ()
Additional contact information
Haolin Ruan: School of Data Science, City University of Hong Kong, Kowloon Tong, Hong Kong
Zhi Chen: Department of Management Sciences, College of Business, City University of Hong Kong, Kowloon Tong, Hong Kong
Chin Pang Ho: School of Data Science, City University of Hong Kong, Kowloon Tong, Hong Kong
INFORMS Journal on Computing, 2023, vol. 35, issue 5, 1002-1023
Abstract:
We study adjustable distributionally robust optimization problems, where their ambiguity sets can potentially encompass an infinite number of expectation constraints. Although such ambiguity sets have great modeling flexibility in characterizing uncertain probability distributions, the corresponding adjustable problems remain computationally intractable and challenging. To overcome this issue, we propose a greedy improvement procedure that consists of solving, via the (extended) linear decision rule approximation, a sequence of tractable subproblems—each of which considers a relaxed and finitely constrained ambiguity set that can be iteratively tightened to the infinitely constrained one. Through three numerical studies of adjustable distributionally robust optimization models, we show that our approach can yield improved solutions in a systematic way for both two-stage and multistage problems.
Keywords: adjustable optimization; distributionally robust optimization; infinitely constrained ambiguity set; linear decision rule (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://dx.doi.org/10.1287/ijoc.2021.0181 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:35:y:2023:i:5:p:1002-1023
Access Statistics for this article
More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().