DYNAMIC-PROGRAMMING AND MAXIMUM PRINCIPLE FOR DISCRETE GOURSAT SYSTEMS

被引:12
|
作者
BELBAS, SA
机构
[1] The University of Alabama, Department of Mathematics, Tuscaloosa
关键词
D O I
10.1016/0022-247X(91)90362-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We obtain the dynamic programming equations for discrete Goursat systems, we prove that they are necessary and sufficient for optimality, and we prove formulas for the exact or approximate solution of these equations. Using dynamic programming arguments, we obtain semi-dynamic programming equations and then we prove a maximum principle of Pontryagin's type. © 1991.
引用
收藏
页码:57 / 77
页数:21
相关论文
共 50 条