Abstract
Two new results are proved concerning polyhedra that arise as relaxations of systems of the form Ax=b, x≥0. One of these theorems is used to relate elementary vectors and blocking polyhedra. In particular, a canonical blocking pair that arises from elementary vectors is described; all blocking pairs arise as minors of blocking pairs of this type. It is noted that a similar relationship between elementary vectors and antiblocking polyhedra follows from the second relaxation theorem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.G. Bland, “Complementary orthogonal subspaces of R n and orientability of matroids”, Dissertation, Cornell University, (Ithaca, 1974).
P. Camion, “Modules unimodulaires”, Journal of Combinatorial Theory 4 (1968) 301–362.
D.R. Fulkerson, “Networks, frames, blocking systems”, in: G.B. Dantzig and A.F. Veinott, Jr., eds., Mathematics of the decision sciences (American Mathematical Society, Providence, 1968) pp. 303–334.
D.R. Fulkerson, “Blocking polyhedra”, in: B. Harris, ed., Graph theory and its applications (Academic Press, New York, 1970) pp. 93–111.
D.R. Fulkerson, “Blocking and antiblocking pairs of polyhedra”, Mathematical Programming 1 (1971) 168–194.
D.R. Fulkerson, “Antiblocking polyhedra”, Journal of Combinatorial Theory 12, (1972) 50–71.
D.R. Fulkerson and D.B. Weinberger, “Blocking pairs of polyhedra arising from network flows”, Journal of Combinatorial Theory (B) 18 (1975) 265–283.
H.-C. Huang, “Investigations on combinatorial optimization”. Dissertation, Yale University (New Haven, 1976).
R.T. Rockafellar, “The elementary vectors of a subspace of R n”, in: R.C. Bose and T.A. Dowling, eds., Combinatorial mathematics and its applications (Univ. of North Carolina Press, Chapel Hill, 1969) 104–127.
L.E. Trotter, Jr., and D.B. Weinberger, “Symmetric blocking and antiblocking relations for generalized circulations”. Technical Report No. 300, Department of Operations Research. Cornell University (1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 The Mathematical Programming Society
About this chapter
Cite this chapter
Bland, R.G. (1978). Elementary vectors and two polyhedral relaxations. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121200
Download citation
DOI: https://doi.org/10.1007/BFb0121200
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00789-7
Online ISBN: 978-3-642-00790-3
eBook Packages: Springer Book Archive