Abstract
We introduce two new formulations for probabilistic constraints based on extended disjunctive formulations. Their strength results from considering multiple rows of the probabilistic constraints together. The properties of the first can be used to construct hierarchies of relaxations for probabilistic constraints, while the second provides computational advantages over other formulations.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call