Article contents
Dynamic programming for discrete-time finite-horizon optimal switching problems with negative switching costs
Published online by Cambridge University Press: 19 September 2016
Abstract
In this paper we study a discrete-time optimal switching problem on a finite horizon. The underlying model has a running reward, terminal reward, and signed (positive and negative) switching costs. Using optimal stopping theory for discrete-parameter stochastic processes, we extend a well-known explicit dynamic programming method for computing the value function and the optimal strategy to the case of signed switching costs.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2016
References
- 3
- Cited by