Skip to main content
Log in

On the use of penumbras in blocking and antiblocking theory

  • Published:
Mathematical Programming Submit manuscript

Abstract

E. Johnson has recently shown that the concept of a penumbra leads to a simple geometric description of the blocker and antiblocker of a given set. Here we develop some basic results on penumbras which permit us to slightly generalize and simplify results on their relationship to blocking and antiblocking theory. In addition, motivated by the obvious symmetry of our results, we examine the effect of reversing the blocking and antiblocking operations.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.A. Aráoz, “Polyhedral neopolarities”, Dissertation, Department of Applied Analysis and Computer Science, University of Waterloo, Waterloo, Canada (1973).

    Google Scholar 

  2. J. Edmonds, V. Griffin and J. Aráoz, “Polarities given by a system of bilinear inequalities”, Working Paper No. 25, Departemento de Matematicas y Ciencia de la Computacion, Universidad Simon Bolivar, Valle de Sartenejas, Venezuela (1977).

    Google Scholar 

  3. W. Fenchel. “A remark on convex sets and polarity”,Meddelanden från Lunds Universitets Matematiska Seminarium (Supplementsband) (1952) 82–89.

    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 and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.

    Google Scholar 

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

    Google Scholar 

  7. V. Griffin, “Polyhedral polarity”, Ph. D. Thesis, Research Report CORR 77/33, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada (1977).

    Google Scholar 

  8. E.L. Johnson, “Support functions, blocking pairs and antiblocking pairs”,Mathematical Programming Study 8 (1977) 167–196.

    Google Scholar 

  9. C. McDiarmid, “Blocking, antiblocking, and pairs of matroids and polymatroids”,Journal of Combinatorial Theory B 25 (1978) 313–325.

    Google Scholar 

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

    Google Scholar 

  11. P.H.M. Ruys,Public goods and decentralization, Tilburg University Press, Tilburg (1974).

    Google Scholar 

  12. J. Tind, “Blocking and antiblocking sets”,Mathematical Programming 6 (1974) 157–166.

    Google Scholar 

  13. M. Todd, “Dual families of linear programs”, Department of Operations Research, Technical Report No. 197, Cornell University, Ithaca, New York (1973).

    Google Scholar 

  14. L.E. Trotter and D.B. Weinberger, “Symmetric blocking and antiblocking relations for generalized circulations”,Mathematical Programming Study 8 (1978) 141–158.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tind, J., Wolsey, L.A. On the use of penumbras in blocking and antiblocking theory. Mathematical Programming 22, 71–81 (1982). https://doi.org/10.1007/BF01581026

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation