Pansystems optimization, generalized principles of optimality, and fundamental equations of dynamic programming

Clarifies the relationship between the Bellman principle of optimality and the recursive functional equation of dynamic programming by optimum operators of pansystems methodology. Instead of the Bellman principle of optimality, two generalized principles of optimality are proposed by which a necessary and sufficient condition for the fundamental equation is obtained. A discrete generalized dynamic programming model is set up in detail. Some discrete optimization problems which cannot be treated by ordinary dynamic programming may be solved by the generalized model with the construction of appropriate optimum operators.