2000-11-02Buch DOI: 10.18452/8247
Structure and stability of probabilistic storage level constraints
We consider the structure of probabilistic storage level constraints as well as the stability of solutions to optimization problems involving such constraints. Apart from the general case, special structures with and without discretization are analyzed. Structures of the feasible set are characterized in terms of convexity and/or connectedness. Stability of solution sets with respect to perturbations of the probability measure is formulated by means of upper and lower semicontinuity of the associated multivalued mapping.