Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs.

Published in: Optim. Lett. (2021)

Keyphrases

chance constrained
upper bound
lower bound
stochastic programming
chance constraints
robust optimization
computationally tractable
knapsack problem
chance constrained programming
multistage
reverse logistics
worst case
linear program