Mathematical Programming

, Volume 38, Issue 1, pp 69–73 | Cite as

Total dual integrality implies local strong unimodularity

  • Albertus M. H. Gerards
  • András Sebő
Article
Received:
Revised:

Abstract

We prove that any totally dual integral description of a full-dimensional polyhedron is locally strongly unimodular in every vertex.

Key words

Unimodularity total dual integrality polyhedral combinatorics Hilbert bases 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Chandrasekaran and S. Shirali, “Total weak modularity: Testing and applications”,Discrete Mathematics 51 (1984) 137–145.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    W. Cook and W. Pulleyblank, “Linear systems for constrained matching problems,” to appear inMathematics of Operations Research.Google Scholar
  3. [3]
    J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs”,Annals of Discrete Mathematics 1 (1977) 185–204.MathSciNetGoogle Scholar
  4. [4]
    D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    R. Giles and W. Pulleyblank, “Total dual integrality and integer polyhedra”,Linear Algebra and its Applications 25 (1979) 191–196.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    A. Hoffman, “A generalisation of max flow-min cut”,Mathematical Programming 6 (1974) 352–359.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    A. Hoffman and R. Oppenheim, “Local unimodularity in the matching polytope”,Annals of Discrete Mathematics 2 (1978) 201–209.MATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    A. Schrijver, “On total dual integrality”,Linear Algebra and its Applications 38 (1981) 27–32.MATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    A. Schrijver,Theory of linear and integer programing (Wiley, Chichester, 1986).Google Scholar
  10. [10]
    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.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1987

Authors and Affiliations

  • Albertus M. H. Gerards
    • 1
  • András Sebő
    • 2
  1. 1.Tilburg UniversityTilburgThe Netherlands
  2. 2.Computer and Automation InstituteBudapestHungary

Personalised recommendations