.png){kind=icon}
返回
Bounds for probabilistic programming with application to a blend planning problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2021.09.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we derive deterministic inner approximations for single and joint independent or dependent probabilistic constraints based on classical inequalities from probability theory such as the onesided Chebyshev inequality, Bernstein inequality, Chernoff inequality and Hoeffding inequality (see Pinter, 1989). The dependent case has been modelled via copulas. New assumptions under which the bounds based approximations are convex allowing to solve the problem efficiently are derived. When the convexity condition can not hold, an efficient sequential convex approximation approach is further proposed to solve the approximated problem. Piecewise linear and tangent approximations are also provided for Chernoff and Hoeffding inequalities allowing to reduce the computational complexity of the associated optimization problem. Extensive numerical results on a blend planning problem under uncertainty are finally provided allowing to compare the proposed bounds with the Second Order Cone (SOCP) formulation and Sample Average Approximation (SAA). (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Stochastic programming
Joint chance-constraints
Bounds
Copulas
Blending problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏Unstable Flow Structures Present at Different Rotational Velocities of the Centrifugal Compressor.png)
EnergiesOAAI
EnergiesIF0
OAAI分享收藏分享收藏Analysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAI分享收藏
查看更多内容