The focus of this paper is to develop the optimization procedures and analyze the complexities of the nonserial diverging branch systems in Dynamic Programming. The optimization procedure of the system is developed such that it helps to reduce the computational demands of the system. The complexity of the network is analyzed with the increasing number of nodes, branches and their connectedness to the main serial system. Determination of the optimal set of nodes for the main serial chain is also investigated.