Skip to main content
SpringerLink
Log in

Generalization of one minimax theorem of Gol'shtein

  • Brief Communications
  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. E. G. Gol'shtein, Duality Theory in Mathematical Programming and Its Applications [in Russian], Moscow (1971).

  2. H. Kneser, “Sur un théoreme fondamental de la théorie des jeux,” C. R. Acad. Sci., Paris,234, No. 25 (1952).

  3. Ky Fan, “Minimax theorems,” in: Infinite Antagonistic Games [in Russian], Moscow (1963).

  4. Yu. B. Germeier, Introduction to the Theory of Operations Research [in Russian], Moscow (1971).

  5. M. Saion, “Some general minimax theorems,” in: Infinite Antagonistic Games [in Russian], Moscow (1963).

Download references

Authors
  1. A. N. Moloshnyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 149–151, May–June, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moloshnyuk, A.N. Generalization of one minimax theorem of Gol'shtein. Cybern Syst Anal 9, 545–548 (1973). https://doi.org/10.1007/BF01069214

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation