Abstract
In this paper, we develop a technique for exact simultaneous upliftings of circuit inequalities of an independence system polytope. The resulting inequalities define new families of valid inequalities for this polytope. They are obtained by simultaneously adding the most appropriate set of variables with the highest possible values of the lifting coefficient that maintain the validity. More specifically, in this technique, we introduce a procedure to generate two conflict hypergraph structures types: hypertrees and clutter. In this setting, we use the hyperedges cardinalities of these structures to compute the suitable lifting coefficient values. We then give necessary and sufficient conditions for both the circuit inequalities and the new families of valid inequalities to be facet-defining. We also give a condition of the positivity of the lifted circuit inequality coefficient values.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference33 articles.
1. On the facets of the mixed?integer knapsack polyhedron
2. Facets of the knapsack polytope
3. Berge C., Graphes et Hypergraphes, Dunod, Paris (1970).
4. Berge C., Graphs and Hypergraphs, North-Holland Publishing Company (1973).
5. Facets of the Complementarity Knapsack Polytope