Decomposition of Converging Branch Multistage Systems
暂无分享，去创建一个
Abstract This article considers an alternate dynamic-programming technique for analysis of converging branch systems. This technique, like superposition, is based on decomposition of the system considered. However, it is not restricted to linear systems. The validity of the approach is shown, and an example problem is presented.
[1] Rutherford Aris,et al. Optimization of multistage cyclic and braching systems by serial procedures , 1964 .
[2] D. B. Johnson,et al. Superposition in branching allocation problems , 1965 .
[3] George L. Nemhauser,et al. Introduction To Dynamic Programming , 1966 .
[4] Douglass J. Wilde,et al. Foundations of Optimization. , 1967 .
[5] C. Beightler,et al. Branch compression and absorption in nonserial multistage systems , 1968 .