Stochastic Programming 1. Consider a following network design problem. Denote by S, C, D the respective sets of suppliers, customers and potential locations for distribution centers. The union of these sets can be viewed as a set of nodes defining a fully-connected graph G = (S U C’ U D, […]