ABSTRACT
Dynamic programming offers two particular features which cause it to be of interest to geographers and planners. First, as was implied by the foregoing definition, it is useful when dealing with large problems. Second, as indicated, the method involves solving a set of ‘subproblems’ sequentially. Recall that dynamic programming proceeds by decomposing a problem into stages. A particularly interesting study which involves an application of dynamic programming to the shortest route problem with an assessment of the number of mistakes made by individuals is that of Scarlett. A problem of interest to geographers and planners which closely resembles the inventory problem in terms of overall structure is that concerning the optimal use of water resources in a river. The foregoing problem may be solved relatively easily via dynamic programming. A particular feature to note concerning the foregoing problem is that the right hand side of the single constraint in determines the range of permissible state variable values.
