Data-driven chance constrained stochastic program

被引:5
作者
Ruiwei Jiang
Yongpei Guan
机构
[1] University of Arizona,Department of Systems and Industrial Engineering
[2] University of Florida,Department of Industrial and Systems Engineering
来源
Mathematical Programming | 2016年 / 158卷
关键词
Stochastic programming; Chance constraints; Semi-infinite programming; 90C15; 90C34;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we study data-driven chance constrained stochastic programs, or more specifically, stochastic programs with distributionally robust chance constraints (DCCs) in a data-driven setting to provide robust solutions for the classical chance constrained stochastic program facing ambiguous probability distributions of random parameters. We consider a family of density-based confidence sets based on a general ϕ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}-divergence measure, and formulate DCC from the perspective of robust feasibility by allowing the ambiguous distribution to run adversely within its confidence set. We derive an equivalent reformulation for DCC and show that it is equivalent to a classical chance constraint with a perturbed risk level. We also show how to evaluate the perturbed risk level by using a bisection line search algorithm for general ϕ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}-divergence measures. In several special cases, our results can be strengthened such that we can derive closed-form expressions for the perturbed risk levels. In addition, we show that the conservatism of DCC vanishes as the size of historical data goes to infinity. Furthermore, we analyze the relationship between the conservatism of DCC and the size of historical data, which can help indicate the value of data. Finally, we conduct extensive computational experiments to test the performance of the proposed DCC model and compare various ϕ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi $$\end{document}-divergence measures based on a capacitated lot-sizing problem with a quality-of-service requirement.
引用
收藏
页码:291 / 327
页数:36
相关论文
共 68 条
[1]  
Ahmed S(2013)Probabilistic set covering with correlations Oper. Res. 61 438-452
[2]  
Papageorgiou D(2013)Robust solutions of optimization problems affected by uncertain probabilities Manage. Sci. 59 341-357
[3]  
Ben-Tal A(2002)A branch and bound method for stochastic integer problems under probabilistic constraints Optim. Methods Softw. 17 359-382
[4]  
den Hertog D(2005)Uncertain convex programs: randomized solutions and confidence levels Math. Program. 102 25-46
[5]  
De Waegenaere A(2006)On distributionally robust chance-constrained linear programs J. Optim. Theory Appl. 130 1-22
[6]  
Melenberg B(1963)Deterministic equivalents for optimizing and satisficing under chance constraints Oper. Res. 11 18-39
[7]  
Rennen G(1958)Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil Manage. Sci. 4 235-263
[8]  
Beraldi P(2010)From CVaR to uncertainty set: implications in joint chance constrained optimization Oper. Res. 58 470-485
[9]  
Ruszczyński A(1994)Stochastic volatility in asset prices estimation with simulated maximum likelihood J. Econom. 64 375-400
[10]  
Calafiore GC(2003)Worst-case value-at-risk and robust portfolio optimization: a conic programming approach Oper. Res. 51 543-556