A New Decomposition Procedure for Dynamic Programming

Abstract

This paper presents a new decomposition procedure that reduces the highspeed memory requirement and interpolations, associated with the dynamic programming algorithm. It shows that an n th-order system described by k coupled difference or differential equations can be treated as a k th-order system with respect to the high-speed memory requirement and interpolations in the dynamic programming procedure.