Relaxations for probabilistically constrained programs with discrete random variables (Q1197883): Difference between revisions
From MaRDI portal
Latest revision as of 14:33, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxations for probabilistically constrained programs with discrete random variables |
scientific article |
Statements
Relaxations for probabilistically constrained programs with discrete random variables (English)
0 references
16 January 1993
0 references
The author suggests a new method providing an outer convex approximation of the (generally nonconvex) set of feasible solutions typical for stochastic linear programs with joint probability constraints and random discretely distributed right-hand sides. The relaxed problems are of the form of linear programs and their optimal values serve as bounds for the optimal value of the original stochastic program.
0 references
outer convex approximation
0 references
stochastic linear programs
0 references
joint probability constraints
0 references
random discretely distributed right-hand sides
0 references
0 references
