Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (Q828647): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:19, 5 March 2024
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