Skip to main content
SpringerLink
Log in
Book cover

Polyhedral Combinatorics pp 167–196Cite as

Support functions, blocking pairs, and anti-blocking pairs

  • Chapter
  • First Online:

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 8))

Abstract

Conditions are given for two sets to be the level sets of a support function. Then, Fulkerson’s concepts of blocking pairs and anti-blocking pairs are generalized, and similar conditions are given for two polyhedra to be an anti-blocker and blocker of some polyhedron.

Part of the work in this paper was supported by Air Force under contract F49620-77-C-0014.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Araoz, “Polyhedral neopolarities”, Ph.D. Thesis, Faculty of Mathematics, Department of Computer Sciences and Applied Analysis, University of Waterloo, Waterloo, Ontario (December 1973).

    Google Scholar 

  2. J. Araoz, J. Edmonds and V. Griffin, “Polarities of polyhedra”, presented at the Bonn Workshop on Integer Programming, Bad Godesburg (September 1975).

    Google Scholar 

  3. E. Balas, “Disjunctive programming: Properties of the convex hull of feasible points”, MSRR No. 348. Carnegie-Mellon University (July 1974).

    Google Scholar 

  4. D.R. Fulkerson, “Blocking polyhedra”, in: B. Harris, ed., Graph theory and its Applications (Academic Press, New York, 1970) pp. 93–112.

    Google Scholar 

  5. D.R. Fulkerson, “Blocking anti-blocking pairs of polyhedra”, Mathematical Programming 1 (1971) 168–194.

    Article  MATH  MathSciNet  Google Scholar 

  6. D.R. Fulkerson, “Anti-blocking polyhedra”, Journal of Combinatorial Theory 12 (1972) 50–71.

    Article  MATH  MathSciNet  Google Scholar 

  7. E.L. Johnson, “Integer programming with continuous variables”, Rept. No. 7418-OR, Institut für ökonometrie und Operations Research, Universität Bonn, presented at the Bonn Workshop on Integer Programming, Bad Godesberg (July 1974).

    Google Scholar 

  8. A. Lehman, “On the width-length inequality”, mimeo. 1965.

    Google Scholar 

  9. R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).

    MATH  Google Scholar 

  10. J. Tind, “Blocking and anti-blocking sets”, Mathematical Programming 6 (1974) 157–166.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Tind, “On antiblocking sets and polyhedra”, in: P.L. Hammer et al., eds., Studies in integer programming, Annals of discrete mathematics, Vol. 1 (North-Holland, Amsterdam, 1977), pp. 507–516.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM T.J. Watson Research Center, Yorktown Heights, New York, USA

    Ellis L. Johnson

Authors
  1. Ellis L. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. L. Balinski A. J. Hoffman

Additional information

Dedicated to D. Ray Fulkerson

Rights and permissions

Reprints and permissions

Copyright information

© 1978 The Mathematical Programming Society

About this chapter

Cite this chapter

Johnson, E.L. (1978). Support functions, blocking pairs, and anti-blocking pairs. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121201

Download citation

  • DOI: https://doi.org/10.1007/BFb0121201

  • 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

Publish with us

Policies and ethics

Search

Navigation