Skip to main content
Log in

Approximation methods of solution of stochastic programming problems

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. Yu. M. Ermol'ev, Methods of Stochastic Programming [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  2. E. A. Nurminskii, “Conditions of convergence of stochastic programming algorithms,” Kibernetika, No. 3, 89–92 (1973).

    Google Scholar 

  3. A. A. Gaivoronskii, “On nonstationary stochastic programming problems,” Kibernetika, No. 5, 89–92 (1978).

    Google Scholar 

  4. A. A. Gaivoronskii and Yu. M. Ermol'ev, “Stochastic programming problems with successive parameter estimation,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 4, 29–38 (1979).

    Google Scholar 

  5. I. I. Gikhman and A. V. Skorokhod (eds.), Theory of Stochastic Processes, Halsted Press (1975).

  6. Yu. M. Ermol'ev (Ermoliev) and A. A. Gaivoronskii (Gaivoronsky), “On simultaneous optimization and approximation procedures,” in: Proc. Second ASA Conf. on Stochastic Programming, 18–23, Luxembourg (1980).

Download references

Authors

Additional information

Translated from Kibernnetika, No. 2, pp. 85–90, March–April, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gaivoronskii, A.A. Approximation methods of solution of stochastic programming problems. Cybern Syst Anal 18, 241–249 (1982). https://doi.org/10.1007/BF01074536

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation