In this paper we outline the Lagrangian constrained optimization method to solve complex problems subject to constraints. Firstly we summarize the Lagrangian constrained optimization routine. Secondly we outline a detailed implementation strategy. Thirdly and finally we provide example and solve...

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 study the question of scheduling impatient customers in parallel server queuing systems. At the time of arrival, customers can be identified as one of many classes, where the class represents the service time and patience time distributions, and cost characteristics. From the system's...

This paper examines a continuous-time intertemporal consumption and portfolio choice problem for an investor with Du e and Epstein (1992a)'s recursive preferences who worries about model misspecification (model uncertainty) and wants to seek robust decision rules. The expected excess return of a...