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

Bismark Singh. Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs. Optimization Letters, 15(2):327-336, 2021. [doi]

Authors

Bismark Singh

This author has not been identified. Look up 'Bismark Singh' in Google