Generalized Disjunctive Programming
- 5.2k Downloads
This chapter documents how to express and solve Generalized Disjunctive Programs (GDPs). GDP models provide a structured approach for describing logical relationships in optimization models.We show how Pyomo blocks provide a natural base for representing disjuncts and forming disjunctions, and we how to solve GDP models through the use of automated problem transformations.
KeywordsConvex Hull Logical Constraint Logical Relationship Exclusive Disjunction Command Line Option
Unable to display preview. Download preview PDF.