GENERALIZED PRINCIPLE OF OPTIMALITY IN PANSYSTEMS NETWORK ANALYSIS

The optimization of a panweight network is studied. A generalized concept summary of optimality is established, which unifies various related principles. This may be viewed as a sort of complement and extension of Bellman's work. Some of its applications in dynamic programming are discussed. A sufficient condition and three necessary conditions are given under which Bellman's principle holds.