Clarke Differentials and the Envelope Theorem in Dynamic Programming
arXiv:2509.17103 · doi:10.23952/cot.2027.1
Abstract
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.