Clarke Differentials and the Envelope Theorem in Dynamic Programming

In this paper, we consider a deterministic dynamic programming model, and derive the envelope theorem using the Clarke differential. Compared with previous research, we do not require differentiability, convexity, or boundedness.