There are many ways in which a problem may be categorised according to its major features — linear, non-linear, continuous, discrete, stochastic, etc. One important category of problems which cuts across all the conventional category boundaries consists of problems which exhibit serial or sequential features. This chapter examines the nature of sequential systems and demonstrates how problems can be solved by a method known as dynamic programming (DP).
Unable to display preview. Download preview PDF.
- Bellman, R., Dynamic Programming (Princeton University Press, 1957)Google Scholar
- Bellman, R., and Dreyfus, S., Applied Dynamic Programming (Princeton University Press, 1962)Google Scholar
- Larson, R. E., and Casti, J. L., Principles of Dynamic Programming. Part 1: Basic Analytic and Computational Methods (Marcel Dekker, New York, 1978)Google Scholar
- Nemhauser, G. L., Introduction to Dynamic Programming (Wiley, New York, 1966)Google Scholar
- Templeman, A. B., and Walters, G. A., Optimal design of stormwater drainage networks for roads, Proc., Instn Civ. Engrs, Part 2, 67, (1979) 573–87Google Scholar