A presentation of a wide variety of complicated multidimensional computational problems that can be treated by dynamic programming theory. Part I considers a logistics problem which involves the purchasing and servicing of numerous items. Part II shows how target-selection problems arising in the attack on a target complex by weapons of several different types or by successive waves of weapons of the same type may be treated. Part III discusses the solution of the optimal-inventory problem with delivery lags of arbitrary length. 17 pp.