Skip to main content
SpringerLink
Log in

A method for the determination of the minimax

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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. P. Huard, “Resolution of mathematical programming with nonlinear constraints by the method of centres,” in: Nonlinear Programming (J. Abadie, Ed.), North-Holland, Amsterdam (1967), pp. 207–220.

    Google Scholar 

  2. J. Cea, Optimization — Theorie et Algorithmes, Dunod, Paris (1971).

    Google Scholar 

  3. A. Klinger and O. L. Mangasarian, “Logarithmic convexity and geometric programming,” J. Mat. Anal. Appl.,24, No. 2, 288–408 (1968).

    Google Scholar 

  4. Ya. I. Zabotin and A. I. Korablev, “Pseudoconvex functionals and their extremal properties,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 4, 27–31 (1974).

    Google Scholar 

Download references

Authors
  1. A. I. Koroblev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 7, pp. 19–23, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koroblev, A.I. A method for the determination of the minimax. J Math Sci 43, 2431–2434 (1988). https://doi.org/10.1007/BF01095646

Download citation

  • Issue Date:

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

Search

Navigation