Difference between revisions of "Convex generalized disjunctive programming (GDP)"

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
Line 33: Line 33:
The following example was taken from: <nowiki>http://egon.cheme.cmu.edu/Papers/IMAGrossmannRuiz.pdf</nowiki>
The following example was taken from: <nowiki>http://egon.cheme.cmu.edu/Papers/IMAGrossmannRuiz.pdf</nowiki>
[[File:GDP numeric example 1.png|frameless|600x600px]]
[[File:GDP numeric example 3.png|frameless|600x600px]]
[[File:GDP numeric example 3.png|frameless|600x600px]]

Revision as of 20:27, 21 November 2020

Edited By: Nicholas Schafhauser, Blerand Qeriqi, Ryan Cuppernull


[ Insert picture from google doc of GDP branching to Logic Based Methods and Reformulation MI(N)LP ]



The two most common ways of reformulating a GDP problem into an MINLP are through Big-M (BM) and Hull Reformulation (HR). BM is the simpler of the two, while HR results in tighter relaxation (smaller feasible region) and faster solution times. (https://kilthub.cmu.edu/articles/A_hierarchy_of_relaxations_for_nonlinear_convex_generalized_disjunctive_programming/6466535)

Below is an example of the reformulation of the GDP problem from the Theory section reformulated into an MINLP by using the Big-M method.

Notice that the boolean term from the original GDP has been converted into a numerical {0,1}. The logic relations have also been converted into linear integer constraints (Hy).


This MINLP reformulation can now be used in well-known solvers (list them here) to calculate a solution.

Numerical Example

The following example was taken from: http://egon.cheme.cmu.edu/Papers/IMAGrossmannRuiz.pdf

GDP numeric example 1.png

GDP numeric example 3.png