The disjunctive procedure and blocker duality

In this paper we relate two rather different branches of polyhedral theory in linear optimization problems: the blocking type polyhedra and the disjunctive procedure of Balas et al. For this purpose, we define a disjunctive procedure over blocking type polyhedra with vertices in [0,1] n , study its...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2002-09, Vol.121 (1), p.1-13
Main Authors: Aguilera, Néstor E., Escalante, Mariana S., Nasini, Graciela L.
Format: Article
Language:English
Subjects:
Algebra
Algebraic geometry
Applied sciences
Blocker duality
Blocking type polyhedra
Clutter
Convex and discrete geometry
Disjunctive procedure
Exact sciences and technology
Geometry
Mathematical programming
Mathematics
Operational research and scientific management
Operational research. Management science
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we relate two rather different branches of polyhedral theory in linear optimization problems: the blocking type polyhedra and the disjunctive procedure of Balas et al. For this purpose, we define a disjunctive procedure over blocking type polyhedra with vertices in [0,1] n , study its properties, and analyze its behavior under blocker duality. We compare the indices of the procedure over a pair of blocking clutter polyhedra, obtaining that they coincide.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(01)00242-6