.png){kind=icon}
返回
Cell -and-bound algorithm for chance constrained programs with discrete distributions
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2017.01.046.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Chance constrained programing (CCP) is often encountered in real-world applications when there is uncertainty in the data and parameters. We consider in this paper a special case of CCP with finite discrete distributions. We propose a novel approach for solving CCP. The methodology is based on the connection between CCP and arrangement of hyperplanes. By involving cell enumeration methods for an arrangement of hyperplanes in discrete geometry, we develop a cell-and-bound algorithm to identify an exact solution to CCP, which is much more efficient than branch-and-bound algorithms especially in the worst case. Furthermore, based on the cell-and-bound algorithm, a new polynomial solvable subclass of CCP is discovered. We also find that the probabilistic version of the classical transportation problem is polynomially solvable when the number of customers is fixed. We report preliminary computational results to demonstrate the effectiveness of our algorithm. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Global optimization
Chance constrained program
Discrete distribution
Cell enumeration
Polynomially solvable
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Analysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAI分享收藏Molecular predictors of response to decitabine in advanced chronic myelomonocytic leukemia: a phase 2 trial.png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容