Abstract
In this paper we study the relaxation of optimal control problems monitored by subdifferential evolution inclusions. First under appropriate convexity conditions, we establish an existence result. Then we introduce the relaxed problem and show that it always has a solution under fairly general hypotheses on the data. Subsequently we examine when the relaxation is admissible. So we show that every relaxed trajectory can be approximated by extremal original ones (i.e. original trajectories generated by bang-bang controls) and that the values of the original and relaxed problems are equal. Some examples are also presented.
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.
