Abstract
We prove that any totally dual integral description of a full-dimensional polyhedron is locally strongly unimodular in every vertex.
Similar content being viewed by others
References
R. Chandrasekaran and S. Shirali, “Total weak modularity: Testing and applications”,Discrete Mathematics 51 (1984) 137–145.
W. Cook and W. Pulleyblank, “Linear systems for constrained matching problems,” to appear inMathematics of Operations Research.
J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs”,Annals of Discrete Mathematics 1 (1977) 185–204.
D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
R. Giles and W. Pulleyblank, “Total dual integrality and integer polyhedra”,Linear Algebra and its Applications 25 (1979) 191–196.
A. Hoffman, “A generalisation of max flow-min cut”,Mathematical Programming 6 (1974) 352–359.
A. Hoffman and R. Oppenheim, “Local unimodularity in the matching polytope”,Annals of Discrete Mathematics 2 (1978) 201–209.
A. Schrijver, “On total dual integrality”,Linear Algebra and its Applications 38 (1981) 27–32.
A. Schrijver,Theory of linear and integer programing (Wiley, Chichester, 1986).
A. Sebö,The Schrijver system of odd join polyhedra, Report No. 85394-OR. Institüt für Ökonometrie und Operations Research, Universität Bonn, to appear inCombinatorica.
Author information
Authors and Affiliations
Additional information
The research of the first author was partly supported by the Netherlands Organization for the Advancement of Pure Research (ZWO).
This note was written while the second author visited the Institute für Ökonometrie und Operations Research, and was supported by Sonderforschungsbereich 303 (DFG).
Rights and permissions
About this article
Cite this article
Gerards, A.M.H., Sebő, A. Total dual integrality implies local strong unimodularity. Mathematical Programming 38, 69–73 (1987). https://doi.org/10.1007/BF02591852
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591852