## Abstract

Let C be a full-dimensional pointed closed convex cone in R^{m} obtained by taking the conic hull of a strictly convex set. Given A ∈ Q^{m×n1}, B ∈ Q^{m×n2}, and b ∈ Q^{m}, a simple conic mixed-integer set (SCMIS) is a set of the form {(x, y) ∈ Z^{n}1 × R^{n}2 | Ax + By -b ∈ C}. In this paper, we give a complete characterization of the closedness of convex hulls of SCMISs. Under certain technical conditions on the cone C, we show that the closedness characterization can be used to construct a polynomial-time algorithm to check the closedness of convex hulls of SCMISs. Moreover, we also show that the Lorentz cone satisfies these technical conditions. In the special case of pure integer problems, we present sufficient conditions, which can be checked in polynomial time, to verify the closedness of intersection of SCMISs.

Original language | English |
---|---|

Pages (from-to) | 70-99 |

Number of pages | 30 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 30 |

Issue number | 1 |

DOIs | |

State | Published - 2016 |

Externally published | Yes |

## Keywords

- Closedness
- Mixed-integer convex programming
- Polynomial-time algorithm