Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2018
|
| Subjects: | |
| Online Access: | https://doaj.org/article/e96e23b9be534d01b99b1c340a647d6c |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|