分布鲁棒机会约束优化问题的研究

doi:10.15960/j.cnki.issn.1007-6093.2020.01.009

Abstract

Abstract: As one of the most important models in stochastic problem, the chance constrained optimization problem has been widely used in the fields of finance, engineering, management and so on. As the practical problems become more and more complex, the probability distribution of the uncertainty is difficult to predict/estimate accurately. Distributionally robust chance constrained optimization problem, as an effective model with ambiguous distributional information about uncertainty, has been proposed in the literature. In recent years, researchers have constantly developed new models for distributionally robust chance constrained optimization problems. The main purpose of this paper is to review recent advances in emerging models for distributionally robust chance constrained optimization problems and their potential applications in practice.

Key words: chance constraints, distributionally robust optimization, algorithm

CLC Number:

O224

GENG Xiaolu, TONG Xiaojiao. A review on distributionally robust chance constrained optimization problems[J]. Operations Research Transactions, 2020, 24(1): 115-130.

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

URL: https://www.ort.shu.edu.cn/EN/10.15960/j.cnki.issn.1007-6093.2020.01.009

https://www.ort.shu.edu.cn/EN/Y2020/V24/I1/115

[1] Charnes A, Cooper W W, Symonds G H. Cost horizons and certainty equivalents:an approach to stochastic programming of heating oil[J]. Management Science, 1958, 4(3):235-263.
[2] Liu B, Iwarnura K. Topological optimization models lot communication network with multiple reliability goals[J]. Computers Mathematics with Applications, 2000, 39(7):59-69.
[3] Lejeune M A, Ruszczyński A. An efficient trajectory method for probabilistic inventory production distribution problems[J]. Operations Research, 2007, 55(2):378-394.
[4] Murr M R, Prékopa A. Solution of a Product Substitution Problem Using Stochastic Programming[M]. New York:Springer, 2000, 252-271.
[5] Takyi A. K, Lence B. J. Surface water quality management using a multiple-realization chance constraint method[J]. Water Resources Research, 1999, 35:1657-1670.
[6] 马艳妮. 机会约束优化问题的Log-Sigmoid近似[D]. 大连:辽宁师范大学, 2014:457-461.
[7] Arrow K, Karlin S, Scarf H. Studies in The Mathematical Theory of Inventary and Production[M]. Stanford:Stanford University Press, 2005.
[8] Delage E. Distributionally robust optimization in context of data-driven problems[D]. Stanford:Stanford University, 2009.
[9] Postek K, Hertog D D, Melenberg B. Tractable counterparts of distributionally robust constraints on risk measures[J]. Ssrn Electronic Journal, 2014.
[10] Hanasusanto G A, Roitch V, Kuhn D, Wiesemann, W. A distributionally robust perspective on uncertainty quantification and chance constrained programming[J]. Mathematical Programming, 2015, 151(1):35-62.
[11] Shapiro A, Kleywegt A J. Minimax analysis of stochastic problems[J]. Optimization Methods and Software, 2002, 17(3):523-542.
[12] Xu H, Liu Y, Sun H. Distributionally robust optimization with matrix moment constraints:Lagrange duality and cutting plane methods[J]. Mathematical Programming, 2017:1-41.
[13] Delage E, Ye Y. Distributionally robust optimization under moment uncertainty with application to data-driven problems[J]. Operations Research, 2010, 58(3):595-612.
[14] Peel D, McLachlan G J. Robust mixture modelling using t-distribution[J]. Statistic and Computing, 2000, 10:105-116.
[15] Wang Z, Glynn W, Ye Y. likelihood robust optimization for data-driven Newsvendor problems[J]. Computational Management Science, 2016, 13(2):241-261.
[16] Hu Z L, Hong J. Kullback-Leibler divergence constrained distributionally robust optimization[EB/OL].(2013-11-23)[2017-09-25].
[17] Esfahani PM, Kuhn D. Data-driven distributionally robust optimization using the Wasserstein metric:performance guarantees and tractable reformulations[J]. Mathematical Programming, 2017, 24(9):1-52.
[18] Calafiore G C, Ghaoui L E. On distributionally robust chance-constrained linear programs[J]. Journal of Optimization Theory and Applications, 2006, 130(1):1-22.
[19] Jiang R, Guan Y. Data-driven chance constrained stochastic program[J]. Mathematical Programming, 2016, 158(1-2):291õ327.
[20] Jiang R, Guan Y. Data-driven chance constrained stochastic program[J]. Mathematical Programming, 2016, 158(1):291-327.
[21] Yang W, Xu H. Distributionally robust chance constraints for non-linear uncertainties[J]. Mathematical Programming, 2016, 155(1-2):231-265.
[22] Xie WJ, Ahmed S. On deterministic reformulations of distributionally robust joint chance constrained optimization problems[J]. Operations Research, 2017.
[23] Guo S, Xu H, Zhang L. Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint[J]. SIAM Journal on Optimization, 2017, 27(2).
[24] Nemirovski A, Shapiro A. Scenario Approximations of Chance Constraints[M]. London:Springer, 2006:3-47.
[25] Rockafellar R T, Uryasev S. Optimization of conditional value-at-risk[J]. The Journal of Risk, 2000, 2:21-41.
[26] Nemirovski A, Shapiro A. Convex approximations of chance constrained programs[J]. Society for Industrial and Applied Mathematics, 2006, 17(4):969-996.
[27] Luedtke J, Ahmed S, Nemhauser G L. An integer programming approach for linear programs with probabilistic constraints[J]. Mathematical Programming, 2010, 122(2):247õ272.
[28] Luedtke J. A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with infinite support[J]. Mathematical Programming, 2014, 146(1):219-244.
[29] V. Yakubovich. S-procedure in nonlinear control theory[J]. Vestnik Leningrad University. 1977, 4:73-93.
[30] Chen W, Sim M, Sun J, et al. From CVaR to uncertainty set:Implications in joint chanceconstrained optimization[J]. Operations Research. 2010, 58(2):470-485.
[31] Zymler S, Kuhn D, Rustem B. Distributionally robust joint chance constraints with secondorder moment information[J]. Mathematical Programming, 2013, 137(1):167-198.
[32] Ben-Tal A, Hochman E. More bounds on the expectation of a convex function of a random variable[J]. Journal of Applied Probability, 1972, 9:803-812.
[33] Hanasusanto G A, Roitch V, Kuhn D, et al. Ambiguous Joint chance constraints under mean and dispersion information[J]. Operations Research, 2017, 65(3).
[34] 赵奔. 一类基于CVaR约束的分布鲁棒投资组合选择问题[D]. 大连:大连理工大学, 2015.
[35] 安晓敏, 罗桂美. 椭球不确定集下的投资组合鲁棒优化模型[J]. 湖南大学学报, 2010, 7(1):89-92.
[36] Chung B D, Yao T, Zhang B. Dynamic traffic assignment under demand uncertainty:a distributional robust chance constrained approach[J]. Network Spatial Economic, 2012, 12(1):167-181.
[37] 张琳. 不确定需求下动态供应链网络设计问题:一种分布式鲁棒联合机会约束的方法[J]. 物流技术, 2014, (05):315-317.
[38] Tong X, Luo X, Yang H, et al. A distributionally robust optimization-based risk-limiting dispatch in power system under moment uncertainty[J]. International Transactions on Electrical Energy Systems, 2017:e2343.
[39] 朱雪松, 汪静, 刘志勇. 采用分布鲁棒优化方法的最小切负荷量计算[J]. 国外电子测量技术, 2015, 10:37-44.

A review on distributionally robust chance constrained optimization problems

PDF

Knowledge

Abstract

Cite this article

share this article

Related Articles 15

Recommended Articles

Metrics

Comments

[1]	CUI Hengxin, JIANG Fan. Inexact proximal point algorithms and projection methods for monotone variational inequalities [J]. Operations Research Transactions, 2026, 30(2): 194-208.
[2]	QIU Yingming, PENG Jianwen. Improved q-trust region algorithm for unconstrained optimization problems [J]. Operations Research Transactions, 2026, 30(2): 209-224.
[3]	ZHANG Xuefeng, PENG Xiao, CHEN Liangyu, YANG Zhengfeng, ZENG Zhenbing. A review of intelligent branch and bound algorithms for mixed integer linear programming problems [J]. Operations Research Transactions, 2026, 30(2): 237-270.
[4]	WEI Jiazhen, BIAN Wei. A survey on research advances in consensus-based optimization algorithm [J]. Operations Research Transactions, 2026, 30(1): 1-23.
[5]	XU Ke, JI Lanping, GONG Hua, LIU Peng, SUN Wenjuan. A coordinated multi-agent production and transportation scheduling on parallel machines based on auction algorithm [J]. Operations Research Transactions, 2026, 30(1): 121-136.
[6]	WU Hongyi, WANG Dong, WAN Long, LUO Wenchang. Approximation algorithm for mixed batch parallel machine scheduling with nested processing set restrictions [J]. Operations Research Transactions, 2026, 30(1): 188-196.
[7]	LIU Cong, JIAN Ailun, YUAN Gonglin. A modified conjugate gradient algorithm with its applications in image recovery problems [J]. Operations Research Transactions, 2026, 30(1): 207-216.
[8]	YANG Jinji, SHEN Chungen, YU Zhensheng. Convergence analysis of an adaptive proximal gradient-subgradient algorithm for square-root-loss regression problems [J]. Operations Research Transactions, 2026, 30(1): 217-234.
[9]	Jiawen YANG, Heming SUN. An iterative algorithm for the optimal approximation solution of matrix equations AXB + CY D = E with generalized constraints [J]. Operations Research Transactions, 2025, 29(4): 27-47.
[10]	Qian XIA, Xingong ZHANG. Online scheduling problem of two flow shop with lookahead interval and incompatible job family [J]. Operations Research Transactions, 2025, 29(4): 103-111.
[11]	Zilin TAN, Honglin LUO. A second-order splitting method with its application [J]. Operations Research Transactions, 2025, 29(4): 121-140.
[12]	Xin SUN, Dongdong GE, Desheng FU, Zhiwei WEI, Fenglian DONG, Shichang PAN. A hybrid distribution recursion and branch and bound algorithm for Petroluem refinery optimization problem [J]. Operations Research Transactions, 2025, 29(4): 141-158.
[13]	Jia WANG, Yuzhi HUANG, Jianxiong YE. Optimal control of a hybrid switching system in a class of microbial fed-batch culture via time-scaling transformation [J]. Operations Research Transactions, 2025, 29(4): 219-230.
[14]	Kaiyuan JIN, Feifeng ZHENG, Ming LIU. Online scheduling model of batch processing machine considering order types and setup time [J]. Operations Research Transactions, 2025, 29(4): 231-240.
[15]	Ruiqing SUN, Rui ZHANG, Yan LAN, Weidong LI. LPT algorithm for early work maximization problem [J]. Operations Research Transactions, 2025, 29(4): 249-254.