Skip to main content
Log in

Two-halfspace closure

  • Short Communication
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

We define a new cutting plane closure for pure integer programs called the two-halfspace closure. It is a natural generalization of the well-known Chvátal-Gomory closure. We prove that the two-halfspace closure is polyhedral. We also study the corresponding two-halfspace rank of any valid inequality and show that it is at most the split rank of the inequality. Moreover, while the split rank can be strictly larger than the two-halfspace rank, the split rank is at most twice the two-halfspace rank. A key step of our analysis shows that the split closure of a rational polyhedron can be obtained by considering the split closures of all k-dimensional (rational) projections of the polyhedron, for any fixed \(k \ge 2\). This result may be of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Notes

  1. While we emphasize the perspective that Chvátal took, Gomory had developed a closely related approach in the late 50s and early 60s [22, 23, 29].

  2. For any family of disjunctions, one can pose similar questions about the closure with respect to this family; such discussions are outside the scope of this paper.

  3. In fact, Theorem 1.1 in [2] shows that any collection of CG cuts contains a finite subcollection of cuts that dominates the entire collection. This is also proved in [1].

References

  1. Andersen, K., Cornuéjols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 102(3), 457–493 (2005)

    Article  MATH  Google Scholar 

  2. Averkov, G.: On finitely generated closures in the theory of cutting planes. Discrete Optim. 9(4), 209–215 (2012)

    Article  MATH  Google Scholar 

  3. Balas, E.: Disjunctive Programming. Springer, New York (2018)

    Book  MATH  Google Scholar 

  4. Basu, A., Conforti, M., Di Summa, M., Jiang, H.: Split cuts in the plane. To appear in SIAM J. on optimization. arxiv.org:2003.05022 (2020)

  5. Basu, A., Hildebrand, R., Köppe, M.: The triangle closure is a polyhedron. Math. Program. Ser. A 145(1–2), 1–40 (2013)

    MATH  Google Scholar 

  6. Basu, A., Conforti, M., Di Summa, M.: A geometric approach to cut-generating functions. Math. Program. 151(1), 153–189 (2015)

    Article  MATH  Google Scholar 

  7. Bell, D.E.: Intersections of corner polyhedra. Int. Inst. Appl. Syst. Anal. Laxenburg, Austria, Res. Memo RM-74-014. (1974)

  8. Bell, D.E.: A theorem concerning the integer lattice. Stud. Appl. Math. 56(2), 187–188 (1977)

    Article  MATH  Google Scholar 

  9. Bell, David E., Fisher, Marshall L.: Improved integer programming bounds using intersections of corner polyhedra. Math. Program. 8(1), 345–368 (1975)

    Article  MATH  Google Scholar 

  10. Bodur, M., Del Pia, A., Dey, S.S., Molinaro, M., Pokutta, S.: Aggregation-based cutting-planes for packing and covering integer programs. Math. Programm. 171(1–2), 331–359 (2018)

    Article  MATH  Google Scholar 

  11. Chvátal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(4), 305–337 (1973)

    Article  MATH  Google Scholar 

  12. Conforti, M., Cornuéjols, G., Zambelli, G.: Integer Programming, vol. 271. Springer, New York (2014)

    MATH  Google Scholar 

  13. Cook, W.J., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Program. 47, 155–174 (1990)

    Article  MATH  Google Scholar 

  14. Cook, W.J., Hartmann, M.E., Kannan, R., McDiarmid, C.: On integer points in polyhedra. Combinatorica 12(1), 27–37 (1992)

    Article  MATH  Google Scholar 

  15. Dash, S., Gunluk, O., Lee, D.: Generalized chvatal-gomory closures for integer programs with bounds on variables. http://www.optimization-online.org/DB_HTML/2019/06/7245.html. (2019)

  16. Dash, S., Günlük, O., Morán R, Diego A.: Lattice closures of polyhedra. Math. Program. 1–29 (2019)

  17. Dash, S., Günlük, O., Morán, R., Diego, A.: On the polyhedrality of cross and quadrilateral closures. Math. Program. 160(1–2), 245–270 (2016)

    Article  MATH  Google Scholar 

  18. Dash, S., Günlük, O., Morán, R., Diego, A.: On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width. SIAM J. Opt. 27(3), 1340–1361 (2017)

    Article  MATH  Google Scholar 

  19. Dash, S., Günlük, O., Lee, D.: On a Generalization of the Chvátal-Gomory Closure. Springer, IPCO, New York (2020)

    Book  MATH  Google Scholar 

  20. Dey, S.S., Iroume, A., Wang, G.: The strength of multi-row aggregation cuts for sign-pattern integer programs. Oper. Res. Lett. 46(6), 611–615 (2018)

    Article  MATH  Google Scholar 

  21. Doignon, J.-P.: Convexity in cristallographical lattices. J. Geometry 3, 71–85 (1973)

    Article  MATH  Google Scholar 

  22. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275–278 (1958)

    Article  MATH  Google Scholar 

  23. Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Recent Advances in Mathematical Programming, pp. 269–302. McGraw-Hill, New York (1963)

    Google Scholar 

  24. Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451–558 (1969)

    Article  MATH  Google Scholar 

  25. Harvey, W.: Computing two-dimensional integer hulls. SIAM J. Comput. 28(6), 2285–2299 (1999)

    Article  MATH  Google Scholar 

  26. Hoffman, A.J.: Binding constraints and Helly numbers. Ann. N. Y. Acad. Sci. 319, 284–288 (1979)

    Article  MATH  Google Scholar 

  27. Keller, W.: Tightening the Chvátal and split operator via low-codimensional lineality spaces. PhD thesis, Department of Mathematics, Otto-von-Guericke-Universität Magdeburg (2019)

  28. Pashkovich, K., Poirrier, L., Pulyassary, H.: The aggregation closure is polyhedral for packing and covering integer programs. arXiv preprint arXiv:1910.03404. (2019)

  29. Ralph, E.: Gomory. An algorithm for the mixed integer problem. Technical Report, DTIC Document (1960)

  30. Scarf, H.E.: An observation on the structure of production sets with indivisibilities. Proc. Natl. Acad. Sci. 74(9), 3637–3641 (1977)

    Article  MATH  Google Scholar 

  31. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)

    MATH  Google Scholar 

Download references

Acknowledgements

We are very grateful to two anonymous referees for very insightful comments. Their suggestions and pointers helped to improve the paper from its initial versions. In particular, one of the referees suggested a shorter and more elegant proof for Theorem 4 which we adopted

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongyi Jiang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Amitabh Basu and Hongyi Jiang gratefully acknowledge support from the Office of Naval Research (ONR) Grant N000141812096, NSF Grant CCF2006587 and the AFOSR Grant FA95502010341.

Appendices

A Integer hull of two dimensional simplicial cones

Definition 6

Given a simplicial cone \(C{\subseteq } \mathbb R^2\), let \(F^1,\dots , F^n\) be the facets of \(C_I\). For every \(i\in \{1,\dots ,n\}\) we denote by \(H^i\) the halfspace defining \(F^i\), which can be described as \(\{x\in \mathbb R^2:\langle a_i,x \rangle \le \delta _i\}\), for some \(a_i\in {\mathbb Z}^2\) of which the two entries are coprime and \(\delta _i\in {\mathbb Z}\). Furthermore, we define \(\widehat{\ell ^i}\) as \(\{x\in \mathbb R^2:\langle a_i,x \rangle = \delta _i+1\}\). Also, let \(\widehat{H^i}\) denote the halfspace described by \(\{x\in \mathbb R^2:\langle a_i,x \rangle \le \delta _i+1\}\).

Definition 7

Given a line \(\ell \subseteq \mathbb R^2\) containing integer points, we call each closed segment whose endpoints are two consecutive integer points of \(\ell \) as a unit interval of \(\ell \).

Theorem 5

Given a simplicial cone \(C\in \mathbb R^2\), the integer hull of C can be derived by taking the split closure of C, and then taking the CG closure of this split closure.

Proof

We use the same notations as in Definition 6. We first verify that \(\mathcal {S}(C)\subseteq \widehat{H^i}\) for every \(i=1, \ldots , n\). Given \(i\in \{1,\ldots ,n\}\), if \(\widehat{l^i}\) does not intersect with C, then C is contained in \(\widehat{H^i}\) and we are done. If \(\widehat{l^i}\) intersects with C. Then there exists a unique unit interval U of \(\widehat{l^i}\) intersecting C. By definition of \(\widehat{l^i}\), the two integer points of U are outside of C. Also, there exists at least one unit interval on \(F^i\). Let \(U'\) be one of them. Then we take the unique split set S containing the apex of C and \({{\,\mathrm{conv}\,}}(U\cup U')\). The two intersection points between the boundaries of S and the boundaries of C determine a split cut H produced by S, which cuts off \(U\cap C\). Thus \(\mathcal {S}(C)\subseteq H\cap C\subseteq \widehat{H^i}{\backslash \widehat{l^i}}\).

Thus by the definition of \(\widehat{H^i}\), the facet defining halfspace \(H^i\) of \(F^i\) is a CG cut for \(\mathcal {S}(C)\), for \(i\in \{1,\ldots ,n\}\). This finishes the proof.\(\square \)

General integer hulls in two dimensions

We give a new proof of the following result.

Theorem 6

[7, 9] Let \(P\subseteq \mathbb R^2\) be any two-dimensional rational polyhedron. Then \(P_I\) is equal to the intersection of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of P.

We break the proof into two cases: \(P_I\) is nonempty or empty. These are dealt with in Theorems 9 and 10 below.

Definition 8

A convex set \(B\subseteq \mathbb R^n\) is a lattice-free convex set if there is no integer point in its interior, and it is maximal if for any lattice-free set \(B'\supseteq B\), we have \(B'=B\).

Theorem 7

In \(\mathbb R^2\), a convex set B is a maximal lattice-free convex set if and only if it satisfies one of the following properties.

  1. 1.

    B is a split set, and each of its facets contains integer points.

  2. 2.

    B is a triangle such that each of its facets contains at least one integer point in its relative interior.

  3. 3.

    B is a four-facet lattice-free set and each of its facet contains exactly one integer point in its relative interior. Moreover, the convex hull of the union of these four integer points is a parallelogram with area 1.

Lemma 2

Let \(Q\in \mathbb R^2\) be a rational polyhedron such that \({{\,\mathrm{int}\,}}(Q)\cap {\mathbb Z}^2=\emptyset \), and Q has four facets \(F_1\), \(F_2\), \(F_3\) and \(F_4\) in clockwise order. Let \(H_i\) and \(l_i\) denote the corresponding facet-defining halfspace and hyperplane for \(i=1,2,3,4\). Assume \(F_1\) contains at least one integer point in its relative interior, and \(l_i\cap {\mathbb Z}^2=\emptyset \) for \(i=2,3,4\). Let the corresponding facet defining halfspace \(H_i\) be \(\{x\in \mathbb R^2:\langle a_i,x\rangle \le \delta _i\}\) for \(i=1,2,3,4\). Then \(H:=\{x\in \mathbb R^2:\langle a_1,x\rangle \ge \delta _1\}\supseteq (H_2\cap H_3)_I\cap (H_2\cap H_4)_I\cap (H_3\cap H_4)_I\).

Proof

We will attempt to construct a maximal lattice-free set containing Q by “pushing its facets out”. More formally, we do the following.

If \((H_1 \cap H_2 \cap H_4) \cap {\mathbb Z}^2 = (H_1 \cap H_2 \cap H_3 \cap H_4) \cap {\mathbb Z}^2\), i.e., removing \(H_3\) does not change the set of integer points, then \(H \supseteq (H_2\cap H_4)_I\) and we are done. Suppose then that \((H_1 \cap H_2 \cap H_4) \cap {\mathbb Z}^2\) contains integer points that are not in \((H_1 \cap H_2 \cap H_3 \cap H_4) \cap {\mathbb Z}^2\). All such integer points must be in the interior of \(H_1 \cap H_2 \cap H_4\), since \(\ell _2\) and \(\ell _4\) do not contain integer points. Therefore, there exists \(\delta '_3 > \delta _3\) such that if one defines \(H'_3 = \{x \in \mathbb R^2: \langle a_3, x \rangle \le \delta '_3\}\), then \(H_1 \cap H_2 \cap H'_3 \cap H_4\) is also lattice free, but the facet corresponding to \(H'_3\) contains integer points in its relative interior. One now checks if removing \(H_2\) introduces new integer points in \(H_1 \cap H_2 \cap H'_3 \cap H_4\). If not, then we observe that \(H \supseteq (H_3\cap H_4)_I\) since \(\delta '_3 > \delta _3\) and we are done. Otherwise, we find \(\delta '_2 > \delta _2\) such that if one defines \(H'_2 = \{x \in \mathbb R^2: \langle a_2, x \rangle \le \delta '_2\}\), then \(H_1 \cap H'_2 \cap H'_3 \cap H_4\) is also lattice free, but the facet corresponding to \(H'_2\) contains integer points in its relative interior. Finally, we “push out” \(H_4\) and either realize that \(H \supseteq (H_2\cap H_3)_I\), or end up with a maximal lattice-free quadrilateral satisfying Case 3. in Theorem 7.

Let us make the notation uniform and use \(H_k'\) and \(\ell _k'\) denote the corresponding facet defining halfspace and hyperplane, and \(v_j\) be the integer point located on the corresponding facet, for \(j=1,2,3,4\). By assumption, \(\ell _k\ne \ell _k'\) for \(k=2,3,4\). Let \(\ell _5\), \(\ell _5'\) and \(\ell _6\) be the lines such that \(\{v_1,v_2\}\subseteq \ell _5\), \(\{v_3,v_4\}\subseteq \ell _5'\), and \(\{v_1,v_4\}\subseteq \ell _6\). Furthermore, let \(H_5\) be the halfspace defined by \(\ell _5\) such that \(v_4\notin H_5\). Similarly \(H_6\) be the halfspace defined by \(\ell _6\) such that \(v_2\notin H_6\). Since there are no integer points between \(\ell _5\) and \(\ell _5'\) (because \(v_1, v_2, v_3, v_4\) form a fundmanetal parallelopiped of the integer lattice), all integer points in \(H'_3 \cap H'_4\) are contained in \(H_5\), except for the points \(v_3\) and \(v_4\). Since these points are not contained in \(H_3\cap H_4\), we must have \((H_3\cap H_4)_I\subseteq H_5\). Similarly, we have \((H_2\cap H_3)_I\subseteq H_6\). Therefore, \((H_2\cap H_3)_I\cap (H_4\cap H_3)_I\subseteq H_5\cap H_6\subseteq H\). \(\square \)

Theorem 8

(Integer Helly’s Theorem [8, 21, 26, 30]) Let \(\mathcal {I}\) be a finite family of convex sets in \(\mathbb R^n\) such that \(\bigcap _{C\in \mathcal {I}}C\cap {\mathbb Z}^n=\emptyset \), then there exists \(\mathcal {I}'\subseteq \mathcal {I}\) such that \(\bigcap _{C\in \mathcal {I}'}C\cap {\mathbb Z}^n=\emptyset \) and \(|\mathcal {I}'| \le 2^n\).

Corollary 3

Given a full dimensional polyhedron \(P\in \mathbb R^2\) with at least four facets, assume only one of its facets F contains integer points in its relative interior. Let H be the facet defining halfspace of F. Furthermore, we assume \({{\,\mathrm{int}\,}}(H)\cap P\cap {\mathbb Z}^2=\emptyset \). Then there exists three facet defining halfspaces for P denoted by \(H_1\), \(H_2\) and \(H_3\) other than H, such that \({{\,\mathrm{int}\,}}(H)\cap H_1\cap H_2\cap H_3\cap {\mathbb Z}^2=\emptyset \) and H is irredundant to \({{\,\mathrm{int}\,}}(H)\cap H_1\cap H_2\cap H_3\).

Theorem 9

Given a polyhedron \(P\in \mathbb R^2\) such that \(P\cap {\mathbb Z}^2\ne \emptyset \). Then \(P_I\) is the intersection of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of P.

Proof

Let H be a halfspace containing \(P_I\) and described by \(\{x\in \mathbb R^2:\langle a,x \rangle \ge \delta \}\). We wish to show that H is valid for the intersection of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of P. For this purpose, we may strengthen H such that its bounding hyperplane has a nonempty intersection with \(P_I\), and show that this strengthening has the desired property. Let \(H'\) be the halfspace \(\{x\in \mathbb R^2:\langle a,x \rangle \le \delta \}\). Let P be the intersection of halfspaces \(H_i:=\{x\in \mathbb R^2:\langle a_i,x \rangle \le \delta _i\}\), and the two entries of \(a_i\) be coprime for \(i=1,\dots ,m\). If \(\delta _i\in {\mathbb Z}\), then let \(H_i'\) be the halfspace \(\{x\in \mathbb R^2:\langle a_i,x \rangle \le \delta _i+\frac{1}{2}\}\). Otherwise, \(H_i'=H_i\). Let \(P'\) be the intersection of \(H_i'\) for \(i=1,\ldots ,m\). Note that \(P_I=P'_I\subseteq {{\,\mathrm{int}\,}}(P')\), and there is no integer point on any facet defining line of \(P'\).

Claim: H is valid for the intersection of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of \(P'\).

Proof

By our assumption, the bounding hyperplane of H contains integer points from \(P_I\). Thus, \(H'\cap P_I\ne \emptyset \). Then \(P'\cap H'\) is a lattice-free set with one facet defined by \(H'\) and containing at least one integer point in its relative interior since \(P'_I=P_I\subseteq {{\,\mathrm{int}\,}}(P)\). If \(P'\cap H'\) has only two or three facets, the proof is trivial. Otherwise, by Corollary 3, there exist three facet defining halfspaces of \(P'\), say \(H'_1\), \(H'_2\) and \(H'_3\), such that \(Q:=H'_1\cap H'_2\cap H'_3\cap H'\) is lattice free and nonempty since \(H'\cap P_I\ne \emptyset \), and \(H'\) is irredundant to Q. Moreover, the facet of Q defined by \(H'\) contains a integer point in its relative interior since \(P_I\subseteq {{\,\mathrm{int}\,}}(P)\). If Q only has two or three facets, then the proof is trivial. If Q has four facets, then by Lemma 2, we can finish the proof.\(\square \)

The claim immediately implies that \(P_I\) is the intersection of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of \(P'\). The proof can be finished by the fact that \(H_i\subseteq H_i'\) for \(i=1,\ldots , m\).\(\square \)

Theorem 10

Given a polyhedron P such that \(P\cap {\mathbb Z}^2= \emptyset \), we have that the intersection, denoted by U, of the integer hulls of all the simplicial cones (or split sets) constructed from pairs of facets of P, is empty.

Proof

By Theorem 8, we can assume P has at most four facets. If P has two or three facets, then the proof is trivial. Therefore, assume P has four facets and let \(H_i\) for \(i=1,\ldots ,4\) denote the facet defining halfspaces in clockwise order. If \(H_1\cap H_3\) or \(H_2\cap H_4\) forms a split set, then the proof is trivial. So we assume both \(H_1\cap H_3\) and \(H_2\cap H_4\) contain integer points. Since \(H_1\cap H_3 \cap {\mathbb Z}^2 \ne \emptyset \), \((H_1\cap H_3\cap H_2)_I\) or \((H_1\cap H_3\cap H_4)_I\) is not empty. Without loss of generality, assume \((H_1\cap H_3\cap H_2)_I\ne \emptyset \). By Theorem 9, we have \((H_1\cap H_3\cap H_2)_I=(H_3\cap H_2)_I\cap (H_1\cap H_2)_I\cap (H_1\cap H_3)_I\). Therefore \(U\subseteq (H_1\cap H_3\cap H_2)_I\). Similarly, using the fact that \(H_2\cap H_4 \cap {\mathbb Z}^2 \ne \emptyset \), we can assume \((H_2\cap H_4\cap H_1)_I\ne \emptyset \) and have \(U\subseteq (H_2\cap H_4\cap H_1)_I\). Hence \(U\subseteq (H_1\cap H_3\cap H_2)_I \cap (H_2\cap H_4\cap H_1)_I\subseteq (H_1 \cap H_2\cap H_3)_I \cap H_4=\emptyset \).\(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Basu, A., Jiang, H. Two-halfspace closure. Math. Program. 197, 411–426 (2023). https://doi.org/10.1007/s10107-022-01802-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-022-01802-x

Keywords

Mathematics Subject Classification

Navigation