Dynamic Programming and a Distributed Parameter Maximum Principle

Abstract

A proof of a distributed parameter maximum principle is given by using dynamic programming. An example problem involving a nonhomogeneous boundary condition is also treated by using the dynamic programming technique and by extending the definition of the differential operator. It is thus demonstrated that for linear systems the dynamic programming approach is just as powerful as the variational approach originally used to derive the maximum principle.