Likelihood robust optimization for data-driven problems

被引:102
|
作者
Wang Z. [1 ]
Glynn P.W. [2 ]
Ye Y. [2 ]
机构
[1] Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, 55455, MN
[2] Department of Management Science and Engineering, Stanford University, Stanford, 94305, CA
基金
美国国家科学基金会;
关键词
Empirical Distribution; Robust Optimization; Convex Optimization Problem; Bayesian Statistic; Daily Return;
D O I
10.1007/s10287-015-0240-3
中图分类号
学科分类号
摘要
We consider optimal decision-making problems in an uncertain environment. In particular, we consider the case in which the distribution of the input is unknown, yet there is some historical data drawn from the distribution. In this paper, we propose a new type of distributionally robust optimization model called the likelihood robust optimization (LRO) model for this class of problems. In contrast to previous work on distributionally robust optimization that focuses on certain parameters (e.g., mean, variance, etc.) of the input distribution, we exploit the historical data and define the accessible distribution set to contain only those distributions that make the observed data achieve a certain level of likelihood. Then we formulate the targeting problem as one of optimizing the expected value of the objective function under the worst-case distribution in that set. Our model avoids the over-conservativeness of some prior robust approaches by ruling out unrealistic distributions while maintaining robustness of the solution for any statistically likely outcomes. We present statistical analyses of our model using Bayesian statistics and empirical likelihood theory. Specifically, we prove the asymptotic behavior of our distribution set and establish the relationship between our model and other distributionally robust models. To test the performance of our model, we apply it to the newsvendor problem and the portfolio selection problem. The test results show that the solutions of our model indeed have desirable performance. © 2015, Springer-Verlag Berlin Heidelberg.
引用
收藏
页码:241 / 261
页数:20
相关论文
共 50 条
  • [1] Data-driven robust optimization
    Bertsimas, Dimitris
    Gupta, Vishal
    Kallus, Nathan
    [J]. MATHEMATICAL PROGRAMMING, 2018, 167 (02) : 235 - 292
  • [2] Data-driven robust optimization
    Dimitris Bertsimas
    Vishal Gupta
    Nathan Kallus
    [J]. Mathematical Programming, 2018, 167 : 235 - 292
  • [3] Data-Driven Conditional Robust Optimization
    Chenreddy, Abhilash
    Bandi, Nymisha
    Delage, Erick
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [4] Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
    Delage, Erick
    Ye, Yinyu
    [J]. OPERATIONS RESEARCH, 2010, 58 (03) : 595 - 612
  • [5] Cooperative Data-Driven Distributionally Robust Optimization
    Cherukuri, Ashish
    Cortes, Jorge
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (10) : 4400 - 4407
  • [6] A NEW DATA-DRIVEN ROBUST OPTIMIZATION APPROACH TO MULTI-ITEM NEWSBOY PROBLEMS
    Kou, Ying
    Wan, Zhong
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (01) : 197 - 223
  • [7] Data-driven robust optimization based on kernel learning
    Shang, Chao
    Huang, Xiaolin
    You, Fengqi
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 2017, 106 : 464 - 479
  • [8] Data-driven Distributionally Robust Optimization for Edge Intelligence
    Zhang, Zhaofeng
    Lin, Sen
    Dedeoglu, Mehmet
    Ding, Kemi
    Zhang, Junshan
    [J]. IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, : 2619 - 2628
  • [9] Data-driven evolutionary sampling optimization for expensive problems
    ZHEN Huixiang
    GONG Wenyin
    WANG Ling
    [J]. Journal of Systems Engineering and Electronics, 2021, 32 (02) : 318 - 330
  • [10] Data-driven evolutionary sampling optimization for expensive problems
    Zhen Huixiang
    Gong Wenyin
    Wang Ling
    [J]. JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2021, 32 (02) : 318 - 330