“…Several surveys on algorithms for SMIP (Schultz et al, 1996, Klein Haneveld and van der Vlerk, 1999, Louveaux and Schultz, 2003, Schultz, 2003, Sen, 2005) and a few textbooks are available (Birge and Louveaux, 1997, Ruszczyn'ski and Shapiro, 2003, Shapiro et al, 2009. Closely related cutting plane methods for SMIP include the method by Carøe and Tind (1997), Carøe (1998) and the disjunctive decomposition (D2) method (Sen et al, 2002, Sen andHigle, 2005). Both methods are based on disjunctive programming (Balas, 1975, Blair and Jeroslow, 1978, Sherali and Shetty, 1980 and provide a rather general setting for the study of the convex hull of feasible points of SMIP problems under the two-stage setting.…”