On solving two-stage distributionally robust disjunctive programs with a general ambiguity set

Manish Bansal*, Sanjay Mehrotra

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We introduce two-stage distributionally robust disjunctive programs (TSDR-DPs) with disjunctive constraints in both stages and a general ambiguity set for the probability distributions. The TSDR-DPs subsume various classes of two-stage distributionally robust programs where the second stage problems are non-convex programs (such as mixed binary programs, semi-continuous program, nonconvex quadratic programs, separable non-linear programs, etc.). TSDR-DP is an optimization model in which the degree of risk aversion can be chosen by decision makers. It generalizes two-stage stochastic disjunctive program (risk-neutral) and two-stage robust disjunctive program (most-conservative). To our knowledge, the foregoing special cases of TSDR-DPs have not been studied until now. In this paper, we develop decomposition algorithms, which utilize Balas’ linear programming equivalent for deterministic disjunctive programs or his sequential convexification approach within L-shaped method, to solve TSDR-DPs. We present sufficient conditions under which our algorithms are finitely convergent. These algorithms generalize the distributionally robust integer L-shaped algorithm of Bansal et al. (SIAM J. on Optimization 28: 2360-2388, 2018) for TSDR mixed binary programs, a subclass of TSDR-DPs. Furthermore, we formulate a semi-continuous program (SCP) as a disjunctive program and use our results for TSDR-DPs to solve general two-stage distributionally robust SCPs (TSDR-SCPs) and TSDR-SCP having semi-continuous inflow set in the second stage.

Original languageEnglish (US)
Pages (from-to)296-307
Number of pages12
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - Dec 1 2019


  • Decomposition algorithms
  • Distributionally robust disjunctive programs
  • Reverse convex program
  • Semi-continuous program
  • Stochastic programming

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'On solving two-stage distributionally robust disjunctive programs with a general ambiguity set'. Together they form a unique fingerprint.

Cite this