Skip to main content
SpringerLink
Log in

Feasibility in capacitated networks: The effect of individual arcs and nodes

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in a capacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.

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. D. Gale, A theorem of flows in networks,Pacific. J. Math. 7 (1957) 1073–1082.

    Google Scholar 

  2. H.J. Greenberg, Consistency, redundancy, and implied equalities in linear systems, UCD/CCM Report 14, University of Colorado at Denver (1994).

  3. A.J. Hoffman, Some recent applications of the theory of linear inequalities to external combinatorial analysis,Proc. Symp. Applied Mathematics 10 (1960) 113–128.

    Google Scholar 

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

    Google Scholar 

  5. S.W. Wallace and R.J-B. Wets, Preprocessing in stochastic programming: The case of uncapacitated networks,ORSA J. Computing 1 (1989) 252–270.

    Google Scholar 

  6. S.W. Wallace and R.J-B. Wets, Preprocessing in stochastic programming: The case of linear programs,ORSA J. Computing 4 (1992) 45–59.

    Google Scholar 

  7. S.W. Wallace and R.J-B. Wets, The facets of the polyhedral set determined by the Gale-Hoffman inequalities,Math. Program. 62 (1993) 215–222.

    Google Scholar 

  8. S.W. Wallace and R.J-B. Wets, Preprocessing in stochastic programming: The case of capacitated networks,ORSA J. Computing 7 (1995) 44–62.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Optimization, Department of Mathematics, Institute of Technology, Linköping University, S-581 83, Linköping, Sweden

    Saied Ghannadan

  2. Department of Managerial Economics and Operations Research, Norwegian University of Science and Technology, N-7034, Trondheim, Norway

    Stein W. Wallace

Authors
  1. Saied Ghannadan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stein W. Wallace
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghannadan, S., Wallace, S.W. Feasibility in capacitated networks: The effect of individual arcs and nodes. Ann Math Artif Intell 17, 145–153 (1996). https://doi.org/10.1007/BF02284628

Download citation

  • Issue Date:

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

Keywords

Search

Navigation