CVAR公司
数学优化
稳健优化
计算机科学
多样性(控制论)
度量(数据仓库)
集合(抽象数据类型)
航程(航空)
预期短缺
最优化问题
风险度量
数学
风险管理
经济
人工智能
文件夹
材料科学
管理
数据库
金融经济学
复合材料
程序设计语言
作者
Wenqing Chen,Melvyn Sim,Jie Sun,Chung‐Piaw Teo
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2009-10-08
卷期号:58 (2): 470-485
被引量:319
标识
DOI:10.1287/opre.1090.0712
摘要
We review and develop different tractable approximations to individual chance-constrained problems in robust optimization on a variety of uncertainty sets and show their interesting connections with bounds on the conditional-value-at-risk (CVaR) measure. We extend the idea to joint chance-constrained problems and provide a new formulation that improves upon the standard approach. Our approach builds on a classical worst-case bound for order statistics problems and is applicable even if the constraints are correlated. We provide an application of the model on a network resource allocation problem with uncertain demand.
科研通智能强力驱动
Strongly Powered by AbleSci AI