Application of the dynamic programming method to standardization problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 1, pp. 33-42
Voir la notice de l'article provenant de la source Math-Net.Ru
A computational scheme of the dynamic-programming method is described for a special class of multiextremum problems. The method is proved and an error bound is derived for the case when the objective function is inexactly specified.
@article{ZVMMF_1990_30_1_a3,
author = {S. M. Aliakbarov},
title = {Application of the dynamic programming method to standardization problems},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {33--42},
publisher = {mathdoc},
volume = {30},
number = {1},
year = {1990},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_1_a3/}
}
TY - JOUR AU - S. M. Aliakbarov TI - Application of the dynamic programming method to standardization problems JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1990 SP - 33 EP - 42 VL - 30 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_1_a3/ LA - ru ID - ZVMMF_1990_30_1_a3 ER -
S. M. Aliakbarov. Application of the dynamic programming method to standardization problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 1, pp. 33-42. http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_1_a3/