ABSTRACT
In this chapter I trace out the derivation of a dynamic programming functional equation for Problem P (s). My main objective is to show how the techniques identified in the analysis of Problem P in Chapter 2 yield this equation when an optimization problem is stated in terms of Format P (s). I therefore do not, at this stage, go into the specifics of how the constructs of Format P (s) that figure in the derivation process are arrived at. I defer discussion on this matter to the second part of the book. On the other hand, I take up a number of general questions whose appreciation, I believe, is vital for a correct understanding of the derivation process. In particular, I explain what is meant by the contention that an instance of Problem P is a dynamic programming problem; and I show that any regular instance of Problem P is a dynamic programming problem.
