Skip to main content
Log in

On Gale's feasibility theorem for certain infinite networks

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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.

References

  1. B. Fuchssteiner andW. Lusky, Convex Cones. North-Holland Mathematics Studies56, North-Holland, Amsterdam 1981.

    Google Scholar 

  2. D. Gale, A theorem on flows in networks. Pacific J. Math.7, 1073–1082 (1957).

    Google Scholar 

  3. H.König and M.Neumann, Mathematische Wirtschaftstheorie. Königstein/Ts. 1986.

  4. M. M.Neumann, The theorem of Gale for infinite networks and applications. In: Infinite Programming, E. J. Anderson and A. B. Philpott, eds., Lecture Notes in Econom. and Math. Systems259. Berlin-Heidelberg-New York 1984.

  5. M. M. Neumann, A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks. Czechoslovak Math. J.34, 156–162 (1984).

    Google Scholar 

  6. W.Oettli, On a general formulation of the Hahn-Banach principle with application to optimization theory. In: Optimization, J.-B. Hiriart-Urruty, W. Oettli and J. Stoer, eds., New York 1983.

  7. M. Yamasaki, Extremum problems on an infinite network. Hiroshima Math. J.5, 223–250 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oettli, W., Yamasaki, M. On Gale's feasibility theorem for certain infinite networks. Arch. Math 62, 378–384 (1994). https://doi.org/10.1007/BF01201792

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation