Skip to main content
SpringerLink
Log in

The facets of the polyhedral set determined by the Gale—Hoffman inequalities

  • Published:
Mathematical Programming Submit manuscript

Abstract

The Gale—Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Balas and W. Pulleyblank, “The perfectly matchable subgraph polytope of a bipartite graph,”Networks 13 (1983) 495–516.

    Google Scholar 

  2. J.W. Chinneck, “Localizing and diagnosing infeasibilities in networks,” Working Paper SCE-90-14, Carleton University (Ottawa, Ont., 1990).

    Google Scholar 

  3. D. Gale, “A theorem of flows in networks,”Pacific Journal of Mathematics 7 (1957) 1073–1082.

    Google Scholar 

  4. H.J. Greenberg, “Diagnosing infeasibility in min-cost network flow problems. Part I: Primal infeasibility,”IMA Journal of Mathematics in Management 2 (1988) 39–51.

    Google Scholar 

  5. M. Grötschel,Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Meisenhein am Glan, 1977).

    Google Scholar 

  6. A. Hoffman, “Some recent applications of the theory of linear inequalities to extremal combinatorial analysis,”Proceedings Symposium Applied Mathematics 10 (1960) 113–128.

    Google Scholar 

  7. E. Horowitz and S. Shani,Fundamentals of Data Structures (Pitman, London, 1976).

    Google Scholar 

  8. D. Klingman, A. Napier and J. Stutz, “NETGEN — a program for generating large scale (un)capacitated assignment, transportation and minimum cost flow networks,”Management Science 20 (1974) 814–822.

    Google Scholar 

  9. A. Prékopa and E. Boros, “On the existence of a feasible flow in a stochastic transportation network,”Operations Research 39 (1991) 119–129.

    Google Scholar 

  10. W. Pulleyblank, “Polyhedral combinatorics,” in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer, Berlin, 1983) pp. 312–345.

    Google Scholar 

  11. R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley, New York, 1984).

    Google Scholar 

  12. W. Wallace and R.J.-B. Wets, “Preprocessing in stochastic programming: the case of capacited networks,” to appear in:ORSA Journal on Computing (1993).

Download references

Author information

Authors and Affiliations

  1. Division of Economics, Norwegian Institute of Technology, The University of Trondheim, Norway

    Stein W. Wallace

  2. Department of Mathematics, University of California, 95616, Davis, CA, USA

    Roger J. -B. Wets

Authors
  1. Stein W. Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roger J. -B. Wets
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.

Research supported in part by NATO Collaborative Research Grant 0785/87.

Supported in part by a grant of the Air Force Office of Scientific Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wallace, S.W., Wets, R.J.B. The facets of the polyhedral set determined by the Gale—Hoffman inequalities. Mathematical Programming 62, 215–222 (1993). https://doi.org/10.1007/BF01585167

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation