Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (Q828647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs |
scientific article |
Statements
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (English)
0 references
5 May 2021
0 references
chance-constrained optimization
0 references
Bonferroni inequalities
0 references
union bounds
0 references
stochastic optimization
0 references
floor function
0 references
linearization
0 references
0 references
0 references
0 references
