In this paper, we consider finite-stage deterministic decision processes. The objective function is associative and the transition follows a converging branch system which is one of the nonserial systems. By using dynamic programming and invariant imbedding technique, the recursive equation is derived under the assumption that the order of decisions is predetermined.
Toshiharu Fujita (Mon,) studied this question.