Near Optimization of Dynamic Systems by Decomposition and Aggregation

Suresh Sethi and Qiang Zhang

Journal of Optimization Theory and Applications, 1998, vol. 99, issue 1, No 1, 22 pages

Abstract: Abstract This paper is concerned with the reduction of a class of optimal control problems to simpler problems by using decomposition and aggregation. Decomposition is shown to provide a good approximation when the system dynamics involve nearly decomposable matrices or variables with strong and weak interactions. Aggregation provides a good approximation if each of the decomposed matrices has one or more dominant eigenvalues. It is shown how one can construct nearly-optimal controls for the given system from the optimal solutions of the simpler reduced problems.

Keywords: Optimal control; dynamical systems; decomposition; aggregation (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021739925071 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:joptap:v:99:y:1998:i:1:d:10.1023_a:1021739925071

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021739925071

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().