A theorem in nonserial dynamic programming

Abstract This note presents a new theorem in nonserial dynamic programming. This theorem, which generalizes a previous one of the authors, allows, in the cases in which it can be employed, cutting down the computational effort for solving the secondary optimization problem.