General Optimal Control Problem
Leonid T. Ashchepkov (),
Dmitriy V. Dolgy,
Taekyun Kim and
Ravi P. Agarwal
Additional contact information
Leonid T. Ashchepkov: Department of Mathematics, Institute of Mathematics and Computer Technologies, Far Eastern Federal University
Dmitriy V. Dolgy: Kwangwoon Glocal Education Center, Kwangwoon University, Department of Mathematics, Institute of Mathematics and Computer Technologies Far Eastern Federal University Vladivostok, Russia
Taekyun Kim: Kwangwoon University, Department of Mathematics
Ravi P. Agarwal: Texas A&M University - Kingsville, Mathematics
Chapter Chapter 12 in Optimal Control, 2021, pp 141-164 from Springer
Abstract:
Abstract The necessary optimality conditions in the General problem of optimal control are set out in several stages. Initially, for optimal process we construct a parameter family of “close” varied processes. The requirement for admissibility of varied processes leads to a finite auxiliary problem of nonlinear programming that depends on parameters of variation. The analysis of the auxiliary problem and the limiting translation by parameters of variation give the required necessary optimality conditions in the form of the Pontryagin’s maximum principle. We consider a using of the maximum principle for various particular cases of the General problem.
Date: 2021
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-91029-7_12
Ordering information: This item can be ordered from
http://www.springer.com/9783030910297
DOI: 10.1007/978-3-030-91029-7_12
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().