On the Rational Polytopes with Chvátal Rank 1
نویسندگان
چکیده
In this paper, we study the following problem: given a polytope P with Chvátal rank 1, does P contain an integer point? Boyd and Pulleyblank observed that this problem is in the complexity class NP ∩ co-NP, an indication that it is probably not NP-complete. We solve this problem in polynomial time for polytopes arising from the satisfiability problem of a given formula with at least three literals per clause, for simplices whose integer hull can be obtained by adding at most a constant number of Chvátal inequalities, and for rounded polytopes. We prove that any closed convex set whose Chvátal closure is empty has an integer width of at most n, and we give an example showing that this bound is tight within an additive constant of 1. The promise that a polytope has Chvátal rank 1 seems hard to verify though. We prove that deciding emptiness of the Chvátal closure of a given rational polytope P is NP-complete, even when P is contained in the unit hypercube or is a rational simplex, and even when P does not contain any integer point. This has two implications: (i) It is NP-hard to decide whether a given rational polytope P has Chvátal rank 1, even when P is contained in the unit cube or is a rational simplex; (ii) The optimization and separation problems over the Chvátal closure of a given rational polytope contained in the unit hypercube or of a given rational simplex are NP-hard. These results improve earlier complexity results of Cornuéjols and Li and Eisenbrand. Finally, we prove that, for any positive integer k, it is NP-hard to decide whether adding at most k Chvátal inequalities is sufficient to describe the integer hull of a given rational polytope.
منابع مشابه
A family of polytopes in the 0/1-cube with Gomory-Chvátal rank at least ((1+1/6)n - 4)
We provide a family of polytopes P ⊆ [0, 1] whose Gomory-Chvátal rank is at least ((1 + 1/6)n− 4).
متن کاملGomory-Chvátal Cutting Planes and the Elementary Closure of Polyhedra
The elementary closure P ′ of a polyhedron P is the intersection of P with all its GomoryChvátal cutting planes. P ′ is a rational polyhedron provided that P is rational. The Chvátal-Gomory procedure is the iterative application of the elementary closure operation to P . The Chvátal rank is the minimal number of iterations needed to obtain PI . It is always finite, but already in R2 one can con...
متن کاملLower Bounds for Chvátal-gomory Style Operators
Valid inequalities or cutting planes for (mixed-) integer programming problems are an essential theoretical tool for studying combinatorial properties of polyhedra. They are also of utmost importance for solving optimization problems in practice; in fact any modern solver relies on several families of cutting planes. The Chvátal-Gomory procedure, one such approach, has a peculiarity that differ...
متن کاملA Refined Gomory-Chvátal Closure for Polytopes in the Unit Cube
We introduce a natural strengthening of Gomory-Chvátal cutting planes for the important class of 0/1-integer programming problems and study the properties of the elementary closure that arises from the new class of cuts. Most notably, we prove that the new closure is polyhedral, we characterize the family of all facet-defining inequalities, and we compare it to elementary closures associated wi...
متن کاملHypercube Related Polytopes
Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
متن کامل