A hierarchy of relaxations for linear generalized disjunctive programming

Generalized disjunctive programming (GDP), originally developed by Raman and Grossmann (1994), is an extension of the well-known disjunctive programming paradigm developed by Balas in the mid 70s in his seminal technical report (Balas, 1974). This mathematical representation of discrete-continuous optimization problems, which represents an alternative to the mixed-integer program (MIP), led to the development of customized algorithms that successfully exploited the underlying logical structure of the problem. The underlying theory of these methods, however, borrowed only in a limited way from the theories of disjunctive programming, and the unique insights from Balas’ work have not been fully exploited.

[1]  J. K. Lowe.  Modelling with Integer Variables. , 1984 .

[2]  I. Grossmann,et al.  New algorithms for nonlinear generalized disjunctive programming , 2000 .

[3]  Aldo R. Vecchietti,et al.  Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations , 2003, Comput. Chem. Eng..

[4]  I. Grossmann,et al.  Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .

[5]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[6]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[7]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[8]  Ignacio E. Grossmann,et al.  A disjunctive programming approach for the optimal design of reactive distillation columns , 2001 .

[9]  Ignacio E. Grossmann,et al.  Logical modeling frameworks for the optimization of discrete-continuous systems , 2006 .

[10]  I. Grossmann,et al.  Disjunctive Programming Models for the Optimal Design of Distillation Columns and Separation Sequences , 2000 .

[11]  Egon Balas,et al.  Sequential convexification in reverse convex and disjunctive programming , 1989, Math. Program..

[12]  Ignacio E. Grossmann,et al.  Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..

[13]  Charles E. Blair.  Facial disjunctive programs and sequence of cutting-planes , 1980, Discret. Appl. Math..

[14]  Robert G. Jeroslow,et al.  Representability in mixed integer programmiing, I: Characterization results , 1987, Discret. Appl. Math..

[15]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[16]  Sebastián Ceria,et al.  Convex programming for disjunctive convex optimization , 1999, Math. Program..

[17]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

[18]  I. Grossmann.  Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .

[19]  Ignacio E. Grossmann,et al.  High-Level Optimization Model for the Retrofit Planning of Process Networks† , 2002 .

[20]  Ignacio E. Grossmann,et al.  A cutting plane method for solving linear generalized disjunctive programming problems , 2005, Comput. Chem. Eng..

[21]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[22]  R. Raman,et al.  Modelling and computational techniques for logic based integer programming , 1994 .

[23]  Mhand Hifi,et al.  Exact algorithms for the guillotine strip cutting/packing problem , 1998, Comput. Oper. Res..

[24]  H. P. Williams,et al.  Logic-Based Decision Support: Mixed Integer Model Formulation , 1989 .