Near Optimization of Dynamic Systems by Decomposition and Aggregation

Journal of Optimization Theory and Applications, Vol. 99, No. 1, pp. 1-22, October 1998

40 Pages Posted: 18 Apr 2008 Last revised: 18 Jan 2009

See all articles by Suresh Sethi

Suresh Sethi

University of Texas at Dallas - Naveen Jindal School of Management

Qing Zhang

University of Georgia - Department of Mathematics

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, dynamic systems, decomposition, aggregation, near optimization

JEL Classification: C61

Suggested Citation

Sethi, Suresh and Zhang, Qing, Near Optimization of Dynamic Systems by Decomposition and Aggregation. Journal of Optimization Theory and Applications, Vol. 99, No. 1, pp. 1-22, October 1998. Available at SSRN: https://ssrn.com/abstract=1121506 or http://dx.doi.org/10.2139/ssrn.1121506

Suresh Sethi (Contact Author)

University of Texas at Dallas - Naveen Jindal School of Management ( email )

800 W. Campbell Road, SM30
Richardson, TX 75080-3021
United States

Qing Zhang

University of Georgia - Department of Mathematics ( email )

Athens, GA 30602
United States
(706) 542-2616 (Phone)
(706) 542-2573 (Fax)

HOME PAGE: http://www.math.uga.edu/~qingz/

Register to save articles to
your library

Register

Paper statistics

Downloads
35
Abstract Views
429
PlumX Metrics