.png){kind=icon}
Return
Approximation and contamination bounds for probabilistic programs
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-010-0811-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Development of applicable robustness results for stochastic programs with probabilistic constraints is a demanding task. In this paper we follow the relatively simple ideas of output analysis based on the contamination technique and focus on construction of computable global bounds for the optimal value function. Dependence of the set of feasible solutions on the probability distribution rules out the straightforward construction of these concavity-based global bounds for the perturbed optimal value function whereas local results can still be obtained. Therefore we explore approximations and reformulations of stochastic programs with probabilistic constraints by stochastic programs with suitably chosen recourse or penalty-type objectives and fixed constraints. Contamination bounds constructed for these substitute problems may be then implemented within the output analysis for the original probabilistic program.
Keywords:
Stochastic programs with probabilistic constraints
Output analysis
Contamination technique
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
Analysis of prognostic factors in male breast cancer: a report of 72 cases from a single institution
OAAI
OAAIShareSaveStochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis.png)
Optimization
OptimizationIF0
PREAI
ShareSaveShareSaveSTOCHASTIC-PROGRAMMING IN WATER MANAGEMENT - A CASE-STUDY AND A COMPARISON OF SOLUTION TECHNIQUES
PREAI
ShareSave
View more