.png){kind=icon}
返回
Data-Driven Chance Constrained and Robust Optimization under Matrix Uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1021/acs.iecr.5b04973.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To solve optimization problems with matrix uncertainty, a novel optimization approach is proposed based on chance-constrained and robust optimization, which focuses on constraints with continuous uncertainty, especially with matrix uncertainty. In chance-constrained approach, constraints with matrix uncertainty are always regarded as joint chance constraints, which can be simplified into individual chance constraints and can be further reformulated into algebraic constraints by robust methods. Motivated by reformulation of chance constraints with right-hand side uncertainty, a novel formulation of constraints with left-hand side uncertainty is proposed, where the uncertainty is described as intervals related to the confidence level of chance constraints. Through using kernel density estimation, confidence sets of uncertain parameters are built to approximate unknown true probability density functions. The approach is illustrated with a motivating and process industry scheduling example with energy consumption uncertainties.
Keyword:
FORMULATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
引用论文
.png){kind=icon}
Chance constrained programming approach to process optimization under uncertainty不确定条件下过程优化的机会约束规划方法
PREAI
分享收藏
查看更多内容