Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,k)-configurations and facets for packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting the facets of zero–one polytopes / rank
 
Normal rank

Latest revision as of 16:38, 14 June 2024

scientific article
Language Label Description Also known as
English
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope
scientific article

    Statements

    Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The authors investigate the problem of irredundant equivalent representation of 0-1 solution to a posynomial inequality and the facial structure of its convex hull. The results are comparable (but not identical) with those already obtained for the knapsack constraint. In the second part of the paper necessary, sufficient, and necessary and sufficient conditions for a constraint induced by a minimal set to be a canonical facet of the polynomial knapsack polytope are given, where the last conditions are valid only for the inequalities having the simple form \(x_ j\leq 1\).
    0 references
    0 references
    minimal covers
    0 references
    extended covering constraints
    0 references
    facet
    0 references
    irredundant equivalent representation
    0 references
    posynomial inequality
    0 references
    polynomial knapsack polytope
    0 references
    0 references