ABSTRACT
By concentrating on dynamic programming’s treatment of nonoptimization problems I hope to bring out more clearly the mechanics of its solution strategy. My thesis is then that examining dynamic programming as a general solution strategy is instructive pedagogically in that it provides deeper insight into its mode of operation; and it is constructive and fruitful methodologically because it furnishes an indication about the directions in which dynamic programming can be extended.
