Solving the Drift Control Problem

References

• Anderson, E. J., Nash, P. and Perold, A. F. (1983). Some properties of a class of continuous linear programs. SIAM Journal on Control and Optimization 21 758–765. MR0710999Google Scholar
• Anderson, E. J. and Nash, P. (1989). Linear Programming in Infinite-Dimensional Spaces. John Wiley, Chichester. MR0893179Google Scholar
• Ata, B., Harrison, J. M. and Shepp, L. A. (2005). Drift rate control of a Brownian processing system. The Annals of Applied Probability 15 1145–1160. MR2134100Google Scholar
• Avram, F. and Karaesmen, F. (1996). A method for computing Double Band Policies for switching between two diffusions. Probability in Engineering Sciences 10 569–590. MR1408617Google Scholar
• Buie, R. N. and Abrham, J. (1973). Numerical solutions to continuous linear programming problems. Mathematical Methods of Operations Research 17 107–117. MR0429103Google Scholar
• Chernoff, H. and Petkau, A. J. (1978). Optimal control of a Brownian motion. SIAM Journal on Applied Mathematics 34 717–731. MR0491451Google Scholar
• Cunningham, W. H. (1976). A network simplex method. Mathematical Programming 11 105–116. MR0462532Google Scholar
• Feldman, R. M. and Valdez-Flores, C. (1996). Applied Probability and Stochastic Processes. PWS Pub Co, Boston.Google Scholar
• Floudas, C. A. and Pardalos, P. M. (2001). Encyclopedia of Optimization 6. Springer.Google Scholar
• Ghosh, A. P. and Weerasinghe, A. P. (2007). Optimal buffer size for a stochastic processing network in heavy traffic. Queueing Systems 55 147–159. MR2319488Google Scholar
• Ghosh, A. P. and Weerasinghe, A. P. (2010). Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic. Stochastic Processes and Their Applications 120 2103–2141. MR2684738Google Scholar
• Harrison, J. M. (1985). Brownian Motion and Stochastic Flow Systems. Wiley, New York. MR0798279Google Scholar
• Helmes, K. and Stockbridge, R. H. (2000). Numerical comparison of controls and verification of optimality for stochastic control problems. Journal of Optimization Theory and Applications 106 107–127. MR1780110Google Scholar
• Helmes, K. and Stockbridge, R. H. (2008). Determining the optimal control of singular stochastic processes using linear programming. In Markov Processes and Related Fields: A Festschrift in Honor of Thomas G. Kurtz, (S. N. Ethier, J. Feng and R. H. Stockbridge, eds.). IMS Collections 137–153. IMS, Ohio. MR2574229Google Scholar
• Hernández-Hernández, D. and Hernández-Lerma, O. (1994). Discounted cost Markov decision processes on Borel spaces: The linear programming formulation. J. Math. Anal. Appl 183 335–351. MR1274144Google Scholar
• Hernández-Hernández, D., Hernández-Lerma, O. and Taksar, M. (1996). The linear programming approach to deterministic optimal control problems. Applicationes Mathematicae 24 17–33. MR1404981Google Scholar
• Hernández-Lerma, O. and González-Hernández, J. (1998). Infinite linear programming and multichain Markov control processes in uncountable spaces. SIAM Journal on Control and Optimization 36 313–335. MR1616582Google Scholar
• Hernández-Lerma, O. and Lasserre, J. B. (1998). Approximation schemes for infinite linear programs. SIAM Journal on Optimization 8 973–998. MR1641282Google Scholar
• Klabjan, D. and Adelman, D. (2006). Existence of optimal policies for semi-Markov decision processes using duality for infinite linear programming. SIAM Journal on Control and Optimization 44 2104–2122. MR2248177Google Scholar
• Kumar, S. and Muthuraman, K. (2004). A numerical method for solving singular stochastic control problems. Operations Research 52 563–582. MR2075794Link, Google Scholar
• Kushner, H. J. and Dupuis, P. (2001). Numerical Methods for Stochastic Control Problems in Continuous Time, second ed. Applications of Mathematics: Stochastic Modelling and Applied Probability 24. Springer-Verlag, New York. MR1800098 (2001g:93002)Google Scholar
• Liao, Y.-C. (1984). Switching and impulsive control of reflected diffusion. Applied Mathematical Optimization 11 153–159. MR0743924Google Scholar
• Manne, A. S. (1960). Linear programming and sequential decisions. Management Science 6 259–267. MR0129022Link, Google Scholar
• Orlin, J. B. (1985). On the simplex algorithm for networks and generalized networks. Mathematical Programming Studies 24 166–178. MR0820998Google Scholar
• Ormeci Matoglu, M. and Vande Vate, J. (2010). A Technical note on drift control with changeover cost. www.isye.gatech.edu/~jvandeva/DriftControlNote.pdf.Google Scholar
• Ormeci Matoglu, M. and Vande Vate, J. (2011). Drift contol with changeover costs. Operations Research 59 427–439. MR2830168Link, Google Scholar
• Perry, D. and Bar-Lev, S. K. (1989). A control of a Brownian storage system with two switchover drifts. Stochastic Analysis and Applications 7 103–115. MR0977253Google Scholar
• Protter, P. (2004). Stochastic Integration and Differential Equations. Springer-Verlag Berlin. MR2020294Google Scholar
• Pullan, M. C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal on Control and Optimization 31 1558–1577. MR1242216Google Scholar
• Puterman, M. L. (2005). Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York. MR1270015Google Scholar
• Rath, J. H. (1977). The optimal policy for a controlled Brownian motion process. SIAM Journal on Applied Mathematics 32 115–125. MR0423599Google Scholar
• Taksar, M. I. (1997). Infinite-dimensional linear programming approach to singular stochastic control. SIAM Journal of Control and Optimization 35 604–625. MR1436641Google Scholar
• Tijms, H. C. (2004). A First Course in Stochastic Models. John Wiley & Sons, Ltd. MR2190630Google Scholar
• Veinott, A. F. (1968). Extreme points of Leontief substitution systems. Linear Algebra and Applications 1 181–194. MR0232590Google Scholar
• Weiss, G. (2008). A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming 115 151–198. MR2403756Google Scholar