The method of state augmentation has been used to convert a state equation having delay to one without delay. A known algorithm of discrete dynamic programming is applied to the augmented system to obtain the optimal control conation. These equations are, then, decomposed in a manner so as to reduce the computational effort needed. The efficiency of the proposed algorithm has been illustrated by making an operations count of the proposed algorithm as compared to that of the augmented system.