“…Other methods for solving large stochastic optimization problems are generally addressed within sampling based techniques or bound based techniques. See, for instance, Ermoliev and Wets [15], Ermoliev and Gairvoronsky [14], Higle and Sen [20], Dantzig and Glynn [6] for the former technique; Birge and Wets [3,4], Edirisinghe and Ziemba [11][12][13], Frauendorfer [16,17] for the latter technique. Noting that the problem to be solved in each stage involves a constraint recourse matrix that is random, many of the standard bounding techniques within stochastic programming are inapplicable in this case.…”