On the convex hull of the union of certain polyhedra (Q1115345): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank

Latest revision as of 12:55, 19 June 2024

scientific article
Language Label Description Also known as
English
On the convex hull of the union of certain polyhedra
scientific article

    Statements

    On the convex hull of the union of certain polyhedra (English)
    0 references
    0 references
    1988
    0 references
    Let a finite collection of polyhedra whose defining linear systems differ only in their right hand side be given. The problem is to find a more compact description of the convex hull of the union of the collection. Such a compact description could be a system whose left hand side is the common left hand side of the individual systems, and whose right hand side is a convex combination of the individual left sides. The main result is a new sufficient condition for validity of such a description. As an application the compact linear characterization of a two terminal Steiner tree polytope is derived.
    0 references
    convex hull
    0 references
    union of certain polyhedra
    0 references
    disjunctive programming
    0 references
    mixed integer representation
    0 references
    0 references

    Identifiers