Skip to main content
SpringerLink
Log in

A linearization method in limiting extremal problems

  • 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. Yu. M. Ermol'ev and E. A. Nurminskii, “Limiting extremal problems,” Kibernetika, No. 4 (1973).

  2. E. A. Nurminskii, “Convergence conditions of stochastic programming algorithms,” Kibernetika, No. 3 (1973).

  3. G. M. Fikhtengol'ts, Course of Integral and Differential Calculus [in Russian], Vol. 2, Fizmatgiz, Moscow (1962).

    Google Scholar 

  4. M. Loève, Probability Theory, Princeton University Press (1963).

  5. N. D. Nikolaeva, “On a convex programming algorithm,” Ékonom. Mat. Metody, No. 5 (1974).

Download references

Authors
  1. Yu. M. Ermol'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. I. Verchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 65–69, March–April, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ermol'ev, Y.M., Verchenko, P.I. A linearization method in limiting extremal problems. Cybern Syst Anal 12, 240–245 (1976). https://doi.org/10.1007/BF01069893

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation