This note shows that basic theorems of dynamic programming hold when the return function is homogeneous of degree theta <= 1.

Over the past decade, a substantial literature on the estimation of discrete choice dynamic programming (DC-DP) models of behavior has developed. However, this literature now faces major computational barriers. Specifically, in order to solve the dynamic programming (DP) problems that generate...