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.
Cite
CITATION STYLE
Hart, W. E., Laird, C. D., Watson, J. P., Woodruff, D. L., Hackebeil, G. A., Nicholson, B. L., & Siirola, J. D. (2017). Generalized disjunctive programming. In Springer Optimization and Its Applications (Vol. 67, pp. 157–164). Springer International Publishing. https://doi.org/10.1007/978-3-319-58821-6_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
