Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/10533
Title: Mixing polyhedra with two non divisible coefficients
Author: Agra, Agostinho
Constantino, Miguel
Keywords: Polyhedral description
Mixed integer programming
Issue Date: Oct-2012
Publisher: Springer Verlag
Abstract: We consider the mixed-integer set X = {(s, x, y) ∈ R × Z^n × Z^m : s + a1 x j ≥ bj , ∀ j ∈ N1, s + a2 y j ≥ dj, j ∈ N2} where N1 = {1,...,n}, N2 = {1,...,m} and a1, a2 ∈ Z_+\{0}. This set may arise in a relaxation of mixed-integer problems such as lot-sizing problems.We decompose X into a small number of subsets whose convex hull description is trivial. The convex hull of X is equal to the closure of the convex hull of the union of those polyhedra. Using a projection theorem from Balas (Discret Appl Math 89:3–44, 1998) we obtain a compact characterization of the facets of the convex hull of X. Then by studying the projection cone we characterize all the facet-defining inequalities of the convex hull of X in the space of the original variables. Each of those inequalities is either a mixed MIR inequality (Günlük and Pochet in Math Programm 90:429–457, 2001), or it is based on a directed cycle on a special bipartite graph. When a1 and a2 are relative prime, the convex hull of X is described by the mixed MIR inequalities.
Peer review: yes
URI: http://hdl.handle.net/10773/10533
DOI: 10.1007/s10107-011-0448-0
ISSN: 0025-5610
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
MathProg2012.pdfDocumento principal568.15 kBAdobe PDFrestrictedAccess


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.