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...

The paper develops a version of Pontryagin's maximum principle for optimal control problems with monotonicity constraints on control variables. Whereas the literature handles such constraints by imposing an assumption of piecewise smoothness on the control variable and treating the slope of this...

This paper aims to represent wage bargaining as an optimal control problem. Specifically, by assuming that employment follows a stock adjustment principle towards the level that maximises profits, i.e., towards labour demand, we build an intertemporal optimising model in which the real wage is...

We investigate a class of optimal control problems that exhibit constant exogenously given delays in the control in the equation of motion of the differential states. Therefore, we formulate an exemplary optimal control problem with one stock and one control variable and review some analytic...