Wasserstein distributionally robust chance-constrained program with moment information

被引:10
作者
Luo, Zunhao [1 ]
Yin, Yunqiang [1 ]
Wang, Dujuan [2 ]
Cheng, T. C. E. [3 ]
Wu, Chin -Chia [4 ]
机构
[1] Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 611731, Peoples R China
[2] Sichuan Univ, China Business Sch, Chengdu 610064, Peoples R China
[3] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Hong Kong, Peoples R China
[4] Feng Chia Univ, Dept Stat, Taichung, Taiwan
基金
中国国家自然科学基金;
关键词
Distributionally robust optimization; Moment-based ambiguity set; Wasserstein ambiguity set; Multi-dimensional knapsack problem; Surgery block allocation problem; WORST-CASE VALUE; VALUE-AT-RISK; OPTIMIZATION; UNCERTAINTY;
D O I
10.1016/j.cor.2023.106150
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper studies a distributionally robust joint chance-constrained program with a hybrid ambiguity set including the Wasserstein metric, and moment and bounded support information of uncertain parameters. For the considered mathematical program, the random variables are located in a given support space, so a set of random constraints with a high threshold probability for all the distributions that are within a specified Was-serstein distance from an empirical distribution, and a series of moment constraints have to be simultaneously satisfied. We first demonstrate how to transform the distributionally robust joint chance-constrained program into an equivalent reformulation, and show that such a program with binary variables can be equivalently reformulated as a mixed 0-1 integer conic program. To reduce the computational complexity, we derive a relaxed approximation of the joint DRCCP-H using McCormick envelop relaxation, and introduce linear relaxed and conservative approximations by using norm-based inequalities when the Wasserstein metric uses the lp-norm with p =/ 1 and p =/ infinity. Finally, we apply this new scheme to address the multi-dimensional knapsack and surgery block allocation problems. The results show that the model with a hybrid ambiguity set yields less conservative solutions when encountering uncertainty over the model with an ambiguity set involving only the Wasserstein metric or moment information, verifying the merit of considering the hybrid ambiguity set, and that the linear approximations significantly reduce the computational time while maintaining high solution quality.
引用
收藏
页数:22
相关论文
共 43 条
  • [1] Wasserstein distributionally robust chance-constrained optimization for energy and reserve dispatch: An exact and physically-bounded formulation
    Arrigo, Adriano
    Ordoudis, Christos
    Kazempour, Jalal
    De Greve, Zacharie
    Toubeau, Jean-Francois
    Vallee, Francois
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 296 (01) : 304 - 322
  • [2] Ben-Tal A., 2001, LECT MODERN CONVEX O
  • [3] Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
    Ben-Tal, Aharon
    den Hertog, Dick
    De Waegenaere, Anja
    Melenberg, Bertrand
    Rennen, Gijs
    [J]. MANAGEMENT SCIENCE, 2013, 59 (02) : 341 - 357
  • [4] On distributionally robust chance-constrained linear programs
    Calafiore, G. C.
    El Ghaoui, L.
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2006, 130 (01) : 1 - 22
  • [5] Distributionally robust scheduling on parallel machines under moment uncertainty
    Chang, Zhiqi
    Ding, Jian-Ya
    Song, Shiji
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (03) : 832 - 846
  • [6] From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
    Chen, Wenqing
    Sim, Melvyn
    Sun, Jie
    Teo, Chung-Piaw
    [J]. OPERATIONS RESEARCH, 2010, 58 (02) : 470 - 485
  • [7] A robust optmization perspective on stochastic programming
    Chen, Xin
    Sim, Melvyn
    Sun, Peng
    [J]. OPERATIONS RESEARCH, 2007, 55 (06) : 1058 - 1071
  • [8] Data-Driven Chance Constrained Programs over Wasserstein Balls
    Chen, Zhi
    Kuhn, Daniel
    Wiesemann, Wolfram
    [J]. OPERATIONS RESEARCH, 2024, 72 (01) : 410 - 424
  • [9] Distributionally robust optimization for sequential decision-making
    Chen, Zhi
    Yu, Pengqian
    Haskell, William B.
    [J]. OPTIMIZATION, 2019, 68 (12) : 2393 - 2422
  • [10] DISTRIBUTIONALLY ROBUST STOCHASTIC KNAPSACK PROBLEM
    Cheng, Jianqiang
    Delage, Erick
    Lisser, Abdel
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2014, 24 (03) : 1485 - 1506