Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming

<p>Discrete-continuous optimization problems in process systems engineering are commonly modeled in algebraic form as mixed-integer linear or nonlinear programming models. Since these models can often be formulated in different ways, there is a need for a systematic modeling framework that provides a fundamental understanding on the nature of these models, particularly their continuous relaxations. This paper describes a modeling framework, Generalized Disjunctive Programming (GDP), which represents problems in terms of Boolean and continuous variables, allowing the representation of constraints as algebraic equations, disjunctions and logic propositions. We provide an overview of major research results that have emerged in this area. Basic concepts are emphasized as well as major classes of formulations that can be derived. These are illustrated with a number of examples in the area of process systems engineering. As will be shown, GDP provides a structured way for systematically deriving mixed-integer optimization models that exhibit strong continuous relaxations.