Intermediate integer programming representations using value disjunctions

Intermediate integer programming representations using value disjunctions

0.00 Avg rating0 Votes
Article ID: iaor20091388
Country: Netherlands
Volume: 5
Issue: 2
Start Page Number: 293
End Page Number: 313
Publication Date: May 2008
Journal: Discrete Optimization
Authors: , ,
Abstract:

We introduce a general technique for creating 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’.

Reviews

Required fields are marked *. Your email address will not be published.