Geodesic
Dynamic programming on Pareto sets
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 6, pp. 58-62.

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

The problem of optimal distribution of a resource is considered. A dynamic programming scheme is proposed. Instead of recurrent equations, stepwise computation of Pareto-optimal points is used on the plane of values of the goal function and resource. Practical realization demonstrates efficiency of this approach. Bibl. 2.
Keywords: dynamic programming, Pareto set. 
@article{DA_2008_15_6_a5,
     author = {V. I. Struchenkov},
     title = {Dynamic programming on {Pareto} sets},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {58--62},
     publisher = {mathdoc},
     volume = {15},
     number = {6},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_6_a5/}
}
TY  - JOUR
AU  - V. I. Struchenkov
TI  - Dynamic programming on Pareto sets
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 58
EP  - 62
VL  - 15
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_6_a5/
LA  - ru
ID  - DA_2008_15_6_a5
ER  - 
%0 Journal Article
%A V. I. Struchenkov
%T Dynamic programming on Pareto sets
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 58-62
%V 15
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2008_15_6_a5/
%G ru
%F DA_2008_15_6_a5
V. I. Struchenkov. Dynamic programming on Pareto sets. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 6, pp. 58-62. http://geodesic.mathdoc.fr/item/DA_2008_15_6_a5/

[1] Bellman R., Dreifus S., Prikladnye zadachi dinamicheskogo programmirovaniya, Nauka, M., 1965, 458 pp. | Zbl

[2] Venttsel E. S., Issledovanie operatsii: zadachi, printsipy, metodologiya, 3-e izd., Drofa, M., 2004, 208 pp. | MR