Abstract
In this paper some replacement problems are considered. These problems are modelled as Markov decision problems. They have a special structure which is used to construct efficient solutions methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
De Ghellinck, G.T. and Eppen, G.D. (1967): Linear programming solutions for separable Markovian decision problems. Management Science 13, 371–394.
Denardo, E.V. (1967): Separable Markovian Markovian decision problems. Management Science 14, 451–462.
Derman, C. (1970): Finite state Markovian decision proceses. Academic Press, New York.
Kallenberg, L.C.M. (1992): Separable Markovian decision problems: the linear programming method in the multichain case. OR Spektrum 14, 43–52.
Puterman, M.L. (1994): Markov decision processes. Wiley, New York.
Serin, Y. (2000): Structured policies for Markov decision processes with linear constraints. Report, Middle East Technical University, Ankara, Turkey.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kallenberg, L. (2001). Special Solution Methods for Replacement Problems. In: Fleischmann, B., Lasch, R., Derigs, U., Domschke, W., Rieder, U. (eds) Operations Research Proceedings. Operations Research Proceedings, vol 2000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56656-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-56656-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41587-9
Online ISBN: 978-3-642-56656-1
eBook Packages: Springer Book Archive