.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Linear programming
Integer programming
Stochastic programming
Chance constrained programming
Heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
Low Epichlorohydrin Concentrations Induce Sister Chromatid Exchanges in Human Lymphocytes «in Vitro».png)
Caryologia
OAAI
CaryologiaIF0
OAAIShareSaveShareSaveShareSaveAnalysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAIShareSaveShareSaveShareSave
View more