Journal of the Operations Research Society of China ›› 2021, Vol. 9 ›› Issue (3): 525-542.doi: 10.1007/s40305-020-00313-w

Previous Articles     Next Articles

Data-driven Stochastic Programming with Distributionally Robust Constraints Under Wasserstein Distance: Asymptotic Properties

Yu Mei1,2, Zhi-Ping Chen1,2, Bing-Bing Ji1,2, Zhu-Jia Xu1,2, Jia Liu1,2   

  1. 1 Department of Computing Science, School of Mathematics and Statistics, Xi'an Jiaotong University, Xi'an 710049, China;
    2 Center for Optimization Technique and Quantitative Finance, Xi'an International Academy for Mathematics and Mathematical Technology, Xi'an 710049, China
  • Received:2019-11-17 Revised:2020-06-12 Online:2021-09-30 Published:2021-09-26
  • Contact: Zhi-Ping Chen,zchen@mail.xjtu.edu.cn;Yu Mei,meiyu414@stu.xjtu.edu.cn;Bing-Bing Ji,bingji0225@stu.xjtu.edu.cn;Zhu-Jia Xu,xzj19930326@163.com;Jia Liu,jialiu@xjtu.edu.cn E-mail:zchen@mail.xjtu.edu.cn;meiyu414@stu.xjtu.edu.cn;bingji0225@stu.xjtu.edu.cn;xzj19930326@163.com;jialiu@xjtu.edu.cn
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (Nos. 11991023, 11901449, 11735011).

Abstract: Distributionally robust optimization is a dominant paradigm for decision-making problems where the distribution of random variables is unknown. We investigate a distributionally robust optimization problem with ambiguities in the objective function and countably infinite constraints. The ambiguity set is defined as a Wasserstein ball centered at the empirical distribution. Based on the concentration inequality of Wasserstein distance, we establish the asymptotic convergence property of the datadriven distributionally robust optimization problem when the sample size goes to infinity. We show that with probability 1, the optimal value and the optimal solution set of the data-driven distributionally robust problem converge to those of the stochastic optimization problem with true distribution. Finally, we provide numerical evidences for the established theoretical results.

Key words: Distributionally robust optimization, Wasserstein distance, Ambiguity set, Asymptotic analysis, Empirical distribution

CLC Number: