On the connectedness of probabilistic constraint sets
For the development of stochastic programming methods the properties of feasible regions under probabilistic (chance) constraints are important. In the present note it is proved that assumption about quasiconvexity of the function involved in the probabilistic constraint is sufficient (no assumptions on related probability distribution are needed) to the connectedness of the feasible region.
scientific article; zbMATH DE number 1752508