Facet inequalities from simple disjunctions in cutting plane theory (Q3707764)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Facet inequalities from simple disjunctions in cutting plane theory |
scientific article; zbMATH DE number 3932796 |
Statements
Facet inequalities from simple disjunctions in cutting plane theory (English)
0 references
1986
0 references
cutting planes
0 references
disjunctive programming
0 references
duality
0 references
facets of the convex hull of disjunctive sets
0 references
extreme points of reverse polars
0 references
cut generation
0 references
0 references
0.8341869115829468
0 references
0.8296922445297241
0 references
0.8150835633277893
0 references
0.8025577664375305
0 references
0.8022658228874207
0 references
The duality between facets of the convex hull of disjunctive sets and the extreme points of reverse polars of these sets is utilized to establish simple rules for the derivation of all facet cuts for simple disjunctions, namely, elementary disjunctions in nonnegative variables. These rules generalize the cut generation procedure underlying polyhedral convexity cuts with negative edge extensions. The latter are also shown to possess some interesting properties with respect to a biextremal problem that maximizes the distance, from the origin, of the nearest point feasible to the cut. A computationally inexpensive procedure is given to generate facet cuts for simple disjunctions which are dominant with respect to any specified preemptive ordering of variables.
0 references