Geodesic
On the algorithms of dynamic programming for optimal processes
Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, no. 3 (2012), pp. 215-218.

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

The problem of discrete optimal control which has $m$ consistently applied objective functions is formulated. In this problem the optimal process, also called $m$-optimal, is sought as a pair of functions defined on a finite set of steps at the links by which one function is uniquely defines the other, with the constraints of these functions with inclusion "$\in$" of their values in the final multiple values of the functions of the known pair. A uniform representation of sets, forming the $k$-optimal processes for $k$ not greater than $m$, is given with construction of nondecreasing sequence, upper limited by this pair by the "$\subset $" inclusions, on the basis of characterization of solvability of the problem.
Keywords: discrete optimal control, consistently applied criteria, dynamic programming, algorithms. 
@article{VSGTU_2012_3_a26,
     author = {V. G. Ovchinnikov},
     title = {On the algorithms of dynamic programming for optimal processes},
     journal = {Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences},
     pages = {215--218},
     publisher = {mathdoc},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSGTU_2012_3_a26/}
}
TY  - JOUR
AU  - V. G. Ovchinnikov
TI  - On the algorithms of dynamic programming for optimal processes
JO  - Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
PY  - 2012
SP  - 215
EP  - 218
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSGTU_2012_3_a26/
LA  - ru
ID  - VSGTU_2012_3_a26
ER  - 
%0 Journal Article
%A V. G. Ovchinnikov
%T On the algorithms of dynamic programming for optimal processes
%J Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
%D 2012
%P 215-218
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSGTU_2012_3_a26/
%G ru
%F VSGTU_2012_3_a26
V. G. Ovchinnikov. On the algorithms of dynamic programming for optimal processes. Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, no. 3 (2012), pp. 215-218. http://geodesic.mathdoc.fr/item/VSGTU_2012_3_a26/

[1] Khachaturov V. R., Veselovskiy V. E., Zlotov A. V., Kaldybaev S. U., Kaliev E. Zh., Kovalenko A. G., Montlevich V. M., Sigal I. Kh., Khachaturov R. V., Combinatorial methods and algorithms for solving discrete optimization problems of large dimension, Nauka, Moscow, 2000, 353 pp. | MR | Zbl

[2] Ovchinnikov V. G., “Algorithms of dynamic programming for optimal and similar processes”, Proceedings of the Fifth All-Russian Scientific Conference with international participation (29–31 May 2008). Part 4, Matem. Mod. Kraev. Zadachi, Samara State Technical Univ., Samara, 2008, 107–112