252 research outputs found
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a
mixed-integer program. We classify the integer variables into blocks, each of
which generates a finite set of vector values. The extended formulation is
constructed by creating a new binary variable for each generated value. Initial
experiments show that the extended formulation can have a more compact complete
description than the original formulation.
We prove that, using this reformulation technique, the facet description
decomposes into one ``linking polyhedron'' per block and the ``aggregated
polyhedron''. Each of these polyhedra can be analyzed separately. For the case
of identical coefficients in a block, we provide a complete description of the
linking polyhedron and a polynomial-time separation algorithm. Applied to the
knapsack with a fixed number of distinct coefficients, this theorem provides a
complete description in an extended space with a polynomial number of
variables.Comment: 26 pages, 5 figure
Split rank of triangle and quadrilateral inequalities
A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [2] and Cornu´ejols and Margot [13] showed that the facet-defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. Through a result by Cook et al. [12], it is known that one particular class of facet- defining triangle inequality does not have a finite split rank. In this paper, we show that all other facet-defining triangle and quadrilateral inequalities have finite split rank. The proof is constructive and given a facet-defining triangle or quadrilateral inequality we present an explicit sequence of split inequalities that can be used to generate it.mixed integer programs, split rank, group relaxations
Solution to the generalized lattice point and related problems to disjunctive programming
Issued as Pre-prints [1-5], Progress reports [1-2], Final summary report, and Final technical report, Project no. E-24-67
Intersection disjunctions for reverse convex sets
We present a framework to obtain valid inequalities for optimization problems
constrained by a reverse convex set, which is defined as the set of points in a
polyhedron that lie outside a given open convex set. We are particularly
interested in cases where the closure of the convex set is either
non-polyhedral, or is defined by too many inequalities to directly apply
disjunctive programming. Reverse convex sets arise in many models, including
bilevel optimization and polynomial optimization. Intersection cuts are a
well-known method for generating valid inequalities for a reverse convex set.
Intersection cuts are generated from a basic solution that lies within the
convex set. Our contribution is a framework for deriving valid inequalities for
the reverse convex set from basic solutions that lie outside the convex set. We
begin by proposing an extension to intersection cuts that defines a two-term
disjunction for a reverse convex set. Next, we generalize this analysis to a
multi-term disjunction by considering the convex set's recession directions.
These disjunctions can be used in a cut-generating linear program to obtain
disjunctive cuts for the reverse convex set.Comment: 24 page
A note on the split rank of intersection cuts
In this note, we present a simple geometric argument to determine a lower bound on the split rank of intersection cuts. As a first step of this argument, a polyhedral subset of the lattice-free convex set that is used to generate the intersection cut is constructed. We call this subset the restricted lattice-free set. It is then shown that ! log 2(l)mixed integer programming, split rank, intersection cuts.
- …