Conditions are given for the existence of feasible potentials on locally finite networks and locally finite hypergraphs.

Contact details are reproduced from the original publication and may be historical.

Werner Oettli

Fakultät für Mathematik und Informatik, Universität Mannheim, 68131 Mannheim, Germany.

Maretsugu Yamasaki

Department of Mathematics, Shimane University, Matsue, Japan 690

  1. C. Berge, A. Ghouila-Houri: Programmes, jeux et réseaux de transport. Dunod, Paris, 1962.Google Scholar
  2. H. König: On some basic theorems in convex analysis, pp.107–144 in Modern Applied Mathematics, ed. by B. Korte. North-Holland, Amsterdam, 1982.Google Scholar
  3. W. Oettli, M. Yamasaki: On Gale’s feasibility theorem for certain infinite networks. Arch. Math. 62 (1994) 378–384.https://doi.org/10.1007/BF01201792Google Scholar
  4. R.T. Rockafellar: Network Flows and Monotropic Optimization. Wiley, New York, 1984.Google Scholar
  5. H.H. Schaefer: Topological Vector Spaces. Springer-Verlag, New York, 1971.https://doi.org/10.1007/978-1-4684-9928-5Google Scholar
  6. P.M. Soardi: Potential Theory on Infinite Networks (Lecture Notes in Mathematics, 1590). Springer-Verlag, Berlin Heidelberg, 1994.https://doi.org/10.1007/BFb0073995Google Scholar
  7. M. Yamasaki: Extremum problems on an infinite network. Hiroshima Math. J. 5 (1975) 223–250.https://doi.org/10.32917/hmj/1206136632Google Scholar
  8. A.H. Zemanian: Infinite Electrical Networks. Cambridge University Press, Cambridge, 1991.https://doi.org/10.1017/CBO9780511895432Google Scholar

W. Oettli, M. Yamasaki. “Existence of Feasible Potentials on Infinite Networks.” Journal of Convex Analysis 3 (1996), No. 1, 71–81. https://doi.org/10.68381/jca03006