Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 52, No. 4, July-August 2004, pp. 563-582
DOI: 10.1287/opre.1030.0107
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Kumar, S.
Right arrow Articles by Muthuraman, K.
Right arrow Search for Related Content

A Numerical Method for Solving Singular Stochastic Control Problems

Sunil Kumar, Kumar Muthuraman

Graduate School of Business, Stanford University, Stanford, California 94305
School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907

skumar{at}stanford.edu
kumar{at}purdue.edu

Singular stochastic control has found diverse applications in operations management, economics, and finance. However, in all but the simplest of cases, singular stochastic control problems cannot be solved analytically. In this paper, we propose a method for numerically solving a class of singular stochastic control problems. We combine finite element methods that numerically solve partial differential equations with a policy update procedure based on the principle of smooth pasting to iteratively solve Hamilton-Jacobi-Bellman equations associated with the stochastic control problem. A key feature of our method is that the presence of singular controls simplifies the procedure. We illustrate the method on two examples of singular stochastic control problems, one drawn from economics and the other from queueing systems.

Subject classifications: dynamic programming/optimal control; singular stochastic control; HJB equations; numerical methods; probability; diffusions; queueing; scheduling; Brownian approximations; economics; investments under uncertainty.
History: Received January 2002; revision received April 2003; accepted May 2003.




This article has been cited by other articles:


Home page
Mathematics of Operations ResearchHome page
A. R. Ward and S. Kumar
Asymptotically Optimal Admission Control of a Queue with Impatient Customers
Mathematics of Operations Research, February 1, 2008; 33(1): 167 - 202.
[Abstract] [PDF]


Home page
Operations ResearchHome page
R. Caldentey and L. M. Wein
Revenue Management of a Make-to-Stock Queue
Operations Research, September 1, 2006; 54(5): 859 - 875.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.