Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Hart, W.E. et al. (2017). Generalized Disjunctive Programming. In: Pyomo — Optimization Modeling in Python. Springer Optimization and Its Applications, vol 67 . Springer, Cham. https://doi.org/10.1007/978-3-319-58821-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-58821-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58819-3
Online ISBN: 978-3-319-58821-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)