The disjunctive procedure and blocker duality

Abstract

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.