Geodesic
A dual truncation algorithm for a two-stage stochastic programming problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (2006), pp. 78-81.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_2006_4_a8,
     author = {A. S. Velichko},
     title = {A dual truncation algorithm for a two-stage stochastic programming problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {78--81},
     publisher = {mathdoc},
     number = {4},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2006_4_a8/}
}
TY  - JOUR
AU  - A. S. Velichko
TI  - A dual truncation algorithm for a two-stage stochastic programming problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2006
SP  - 78
EP  - 81
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2006_4_a8/
LA  - ru
ID  - IVM_2006_4_a8
ER  - 
%0 Journal Article
%A A. S. Velichko
%T A dual truncation algorithm for a two-stage stochastic programming problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2006
%P 78-81
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2006_4_a8/
%G ru
%F IVM_2006_4_a8
A. S. Velichko. A dual truncation algorithm for a two-stage stochastic programming problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 4 (2006), pp. 78-81. http://geodesic.mathdoc.fr/item/IVM_2006_4_a8/

[1] Yudin D. B., Zadachi i metody stokhasticheskogo programmirovaniya, Sov. radio, M., 1979, 392 pp.

[2] Birge J. R., “Decomposition and partitioning methods for multistage stochastic linear programs”, Operat. Research, 1985, no. 33, 989–1007 | DOI | MR | Zbl

[3] Fragniere E., Gondzio J., Vial J.-P., “Building and solving large-scale stochastic programs on an affordable distributed computing system”, Annals Operat. Research, 2000, no. 99, 167–187 | DOI | MR | Zbl

[4] Lesdon L. S., Optimizatsiya bolshikh sistem, Mir, M., 1975, 432 pp.

[5] Tsurkov V. I., Dekompozitsiya v zadachakh bolshoi razmernosti, Nauka, M., 1981, 351 pp. | MR

[6] Velichko A. S., Nurminskii E. A., Opyt dekompozitsii metoda konechnykh elementov s ispolzovaniem teorii strukturirovannykh optimizatsionnykh zadach, Elektronnyi zhurnal “Issledovano v Rossii” , 2002, S. 1237–1256 http://zhurnal.ape.relarn.ru/articles/2002/113.pdf

[7] Nurminskii E. A., Chislennye metody vypukloi optimizatsii, Nauka, M., 1991, 168 pp. | MR

[8] Tsentr kollektivnogo polzovaniya “Dalnevostochnyi vychislitelnyi resurs” IAPU DVO RAN, http://www.dvo.ru/bbc

[9] Velichko A. S., Nurminskii E. A., “Pryamo-dvoistvennaya dekompozitsiya dlya zhestkikh ekstremalnykh zadach”, Informatsionnyi byulleten assotsiatsii matematicheskogo programmirovaniya, no. 10, Ekaterinburg, 2003, 65–68

[10] Velichko A. S., Nurminskii E. A., “Pryamo-dvoistvennaya dekompozitsiya zadachi o replikatsii portfelya rynochnykh aktivov”, Avtomatika i telemekhanika, 2004, no. 2, 170–178 | MR | Zbl