Abstract
We survey some applications and extensions of disjunctive programming with special emphasis on recent developments. Specifically, after recalling the basic ingredients of disjunctive inequalities we report on recent results in the context of mixed integer linear programming. We then consider the application of disjunctive constraints both as modeling tool and cutting planes in mixed integer nonlinear programming. Finally, we discuss the application of disjunctions as branching conditions in enumerative algorithms, as opposed to the cutting approach.
| Original language | English |
|---|---|
| Title of host publication | Wiley Encyclopedia of Operations Research and Management Science |
| Publisher | wiley |
| Pages | 1-10 |
| Number of pages | 10 |
| ISBN (Electronic) | 9780470400531 |
| ISBN (Print) | 9780470400630 |
| DOIs | |
| Publication status | Published - 1 Jan 2010 |
| Externally published | Yes |
Keywords
- MILP
- MINLP
- branching
- disjunctive inequalities
- generalized disjunctive programming