Abstract
A new approach is proposed for the solution of large-scale constrained optimal control problems. The method is based on aggregation-disaggregation ideas and is within the class of feasible decomposition methods (Singh and Tilti, Systems: Decomposition, Optimization and Control. Pergamon Press, Oxford 1978). It is shown that the problem of updating the disaggregation in each iteration decomposes into independent subproblems of lower dimension. Numerical results are 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.
