Advertisement

Generalized Disjunctive Programming

  • William E. Hart
  • Carl D. Laird
  • Jean-Paul Watson
  • David L. Woodruff
  • Gabriel A. Hackebeil
  • Bethany L. Nicholson
  • John D. Siirola
Chapter
  • 5.2k Downloads
Part of the Springer Optimization and Its Applications book series (SOIA, volume 67)

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.

Keywords

Convex Hull Logical Constraint Logical Relationship Exclusive Disjunction Command Line Option 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • William E. Hart
    • 1
  • Carl D. Laird
    • 1
  • Jean-Paul Watson
    • 1
  • David L. Woodruff
    • 2
  • Gabriel A. Hackebeil
    • 3
  • Bethany L. Nicholson
    • 1
  • John D. Siirola
    • 1
  1. 1.Sandia National LaboratoriesAlbuquerqueUSA
  2. 2.Graduate School of ManagementUniversity of California, DavisDavisUSA
  3. 3.Department of Industrial and Operations EngineeringUniversity of MichiganAnn ArborUSA

Personalised recommendations