An Introduction to Dynamic Programming

Optimal control theory is introduced at a level appropriate for the undergraduate student. The principle of optimality is derived and used to develop the computational algorithm of dynamic programming. Two numerical examples, a routing problem and an optimal control problem, are solved to illustrate the basic concepts and the computational procedure. Supplementary problems with partial solutions are provided.