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

A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a discrete problem with n states and n choices, the algorithm requires at most nlog2(n)+5n objective function evaluations. In contrast, existing methods for nonconcave problems require...

We revisit a service provider's problem to match supply and demand via an online appointment system such as a doctor in the health care sector. We identify in a survey that an extensive set of available appointments leads to significantly less demand because customers infer a lower quality of...

A central problem in revenue management, known as the assortment problem, consists in deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are constructed by fixing a threshold...

This work concerns the assortment optimization problem that refers to selecting a subset of items that maximizes the expected revenue in the presence of the substitution behavior of consumers specified by a parametric choice model. The key challenge lies in the computational difficulty of...

We present a methodology to estimate fixed cost parameters relevant to the decision to operate, mothballor retire an open-cycle gas turbine (OCGT) using a dynamic discrete choice model, based on fuel andelectricity prices, as well as technical data and the operational status of OCGTs in the PJM...