We study general dynamic programming problems with continuous and discrete choices and general constraints. The value functions may have kinks arising (1) at indifference points between discrete choices and (2) at constraint boundaries. Nevertheless, we establish a general envelope theorem:...

We introduce a fast upper-envelope scan (FUES) method to compute solutions for dynamic programming problems with continuous and discrete choices. The FUES method builds on the standard endogenous grid method (EGM). Standard EGM applied to problems with continuous and discrete choices does not by...