Intersection cuts for mixed integer conic quadratic sets

27Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Balas introduced intersection cuts for mixed integer linear sets. Intersection cuts are given by closed form formulas and form an important class of cuts for solving mixed integer linear programs. In this paper we introduce an extension of intersection cuts to mixed integer conic quadratic sets. We identify the formula for the conic quadratic intersection cut by formulating a system of polynomial equations with additional variables that are satisfied by points on a certain piece of the boundary defined by the intersection cut. Using a software package from algebraic geometry we then eliminate variables from the system and get a formula for the intersection cut in dimension three. This formula is finally generalized and proved for any dimension. The intersection cut we present generalizes a conic quadratic cut introduced by Modaresi, Kilinc and Vielma. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Andersen, K., & Jensen, A. N. (2013). Intersection cuts for mixed integer conic quadratic sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7801 LNCS, pp. 37–48). https://doi.org/10.1007/978-3-642-36694-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free