.png){kind=icon}
返回
A linear programming approach for linear programs with probabilistic constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.04.049.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study a class of mixed-integer programs for solving linear programs with joint probabilistic constraints from random right-hand side vectors with finite distributions. We present greedy and dual heuristic algorithms that construct and solve a sequence of linear programs. We provide optimality gaps for our heuristic solutions via the linear programming relaxation of the extended mixed-integer formulation of Luedtke et al. (2010) [13] as well as via lower bounds produced by their cutting plane method. While we demonstrate through an extensive computational study the effectiveness and scalability of our heuristics, we also prove that the theoretical worst-case solution quality for these algorithms is arbitrarily far from optimal. Our computational study compares our heuristics against both the extended mixed-integer programming formulation and the cutting plane method of Luedtke et al. (2010) [13]. Our heuristics efficiently and consistently produce solutions with small optimality gaps, while for larger instances the extended formulation becomes intractable and the optimality gaps from the cutting plane method increase to over 5%. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Linear programming
Integer programming
Stochastic programming
Chance constrained programming
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Low Epichlorohydrin Concentrations Induce Sister Chromatid Exchanges in Human Lymphocytes «in Vitro».png)
Caryologia
OAAI
CaryologiaIF0
OAAI分享收藏Analysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAI分享收藏
查看更多内容