Abstract
AbstractIn this paper we derive sufficient conditions for optimal control problems with mixed control and state constraints by applying a dual approach to the dynamic programming. These conditions guarantee that a relative minimum is achieved. We seek an optimal pair in the class of those admissible pairs for which graphs of trajectories belong to a set defined by a function satisfying a dual equation of dynamic programming. This set usually differs from the classical neighbourhood of an optimal trajectory. We prove a verification theorem and introduce an optimal dual feedback control. Copyright © 2005 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
