On the Best Main Serial Chain of Nonserial Loop Networks in Dynamic Programming

Abstract

The determination of the best main serial chain in a nonserial network plays an important role in reducing the dimensionality required for its optimization via dynamic programming. We consider looped nonserial systems and present the characteristics of a best main serial chain in various types of nonserial network systems. The result is based on a complexity analysis of the algorithms proposed for such systems.