Sufficient optimality conditions and the dual dynamic programming for the calculus of variations

被引：0
|
作者：
Mlynarska, E [1 ]
机构：
[1] Univ Lodz, Fac Math, PL-90238 Lodz, Poland
来源：
CONTROL AND CYBERNETICS | 1997年 / 26卷 / 04期
关键词：
calculus of variations; dual Hamilton-Jacobi inequality; sufficient optimality conditions; relative minimum;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The paper concerns an application of the idea of the dual dynamic programming to the classical sufficient optimality conditions for the problem of the calculus of variations. By making use of the dual Hamilton-Jacobi inequality, we prove sufficient optimality conditions for a relative minimum.
引用
收藏
页码：641 / 652
页数：12
相关论文
共 50 条
12345