ON THE ALGORITHMS OF DYNAMIC PROGRAMMING FOR OPTIMAL PROCESSES

被引：2

作者：

Ovchinnikov, V. G. ^{[1
]}

机构：

[1] Samara State Tech Univ, Dept Oil & Gas Fields Dev, 244 Molodogvardeyskaya St, Samara 443100, Russia

来源：

VESTNIK SAMARSKOGO GOSUDARSTVENNOGO TEKHNICHESKOGO UNIVERSITETA-SERIYA-FIZIKO-MATEMATICHESKIYE NAUKI | 2012年 / 03期

关键词：

discrete optimal control; consistently applied criteria; dynamic programming; algorithms;

D O I：

10.14498/vsgtu1102

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

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 "is an element of" 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 of" inclusions, on the basis of characterization of solvability of the problem.

引用

页码：215 / 218

页数：4