IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v208y2013i1p63-9410.1007-s10479-011-1047-4.html
   My bibliography  Save this article

Derman’s book as inspiration: some results on LP for MDPs

Author

Listed:
  • Lodewijk Kallenberg

Abstract

In 1976 I was looking for a suitable subject for my PhD thesis. My thesis advisor Arie Hordijk and I found a lot of inspiration in Derman’s book (Finite state Markovian decision processes, Academic Press, New York, 1970 ). Since that time I was interested in linear programming methods for Markov decision processes. In this article I will describe some results in this area on the following topics: (1) MDPs with the average reward criterion; (2) additional constraints; (3) applications. These topics are the main elements of Derman’s book. Copyright The Author(s) 2013

Suggested Citation

  • Lodewijk Kallenberg, 2013. "Derman’s book as inspiration: some results on LP for MDPs," Annals of Operations Research, Springer, vol. 208(1), pages 63-94, September.
    • Handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:63-94:10.1007/s10479-011-1047-4
    DOI: 10.1007/s10479-011-1047-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-1047-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-1047-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Guy T. de Ghellinck & Gary D. Eppen, 1967. "Linear Programming Solutions for Separable Markovian Decision Problems," Management Science, INFORMS, vol. 13(5), pages 371-394, January.
    2. Eric V. Denardo, 1968. "Separable Markovian Decision Problems," Management Science, INFORMS, vol. 14(7), pages 451-462, March.
    3. DE GHELLINCK, Guy T. & EPPEN, Gary D., 1967. "Linear programming solutions for separable Markovian decision problems," LIDAM Reprints CORE 6, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Eric V. Denardo, 1970. "On Linear Programming in a Markov Decision Problem," Management Science, INFORMS, vol. 16(5), pages 281-288, January.
    5. Alan S. Manne, 1960. "Linear Programming and Sequential Decisions," Management Science, INFORMS, vol. 6(3), pages 259-267, April.
    6. A. Hordijk & L. C. M. Kallenberg, 1979. "Linear Programming and Markov Decision Chains," Management Science, INFORMS, vol. 25(4), pages 352-362, April.
    7. Cyrus Derman, 1962. "On Sequential Decisions and Markov Chains," Management Science, INFORMS, vol. 9(1), pages 16-24, October.
    8. Morton Klein, 1962. "Inspection--Maintenance--Replacement Schedules Under Markovian Deterioration," Management Science, INFORMS, vol. 9(1), pages 25-32, October.
    9. A. Hordijk & L. C. M. Kallenberg, 1984. "Constrained Undiscounted Stochastic Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 9(2), pages 276-289, May.
    10. Harvey M. Wagner & John S. C. Yuan, 1968. "Algorithmic Equivalence in Linear Fractional Programming," Management Science, INFORMS, vol. 14(5), pages 301-306, January.
    11. Yih Ren Chen & Michael N. Katehakis, 1986. "Linear Programming for Finite State Multi-Armed Bandit Problems," Mathematics of Operations Research, INFORMS, vol. 11(1), pages 180-183, February.
    12. Michael N. Katehakis & Arthur F. Veinott, 1987. "The Multi-Armed Bandit Problem: Decomposition and Computation," Mathematics of Operations Research, INFORMS, vol. 12(2), pages 262-268, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nandyala Hemachandra & Kamma Sri Naga Rajesh & Mohd. Abdul Qavi, 2016. "A model for equilibrium in some service-provider user-set interactions," Annals of Operations Research, Springer, vol. 243(1), pages 95-115, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. B. Curtis Eaves & Arthur F. Veinott, 2014. "Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 597-606, August.
    2. Michael O’Sullivan & Arthur F. Veinott, Jr., 2017. "Polynomial-Time Computation of Strong and n -Present-Value Optimal Policies in Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 577-598, August.
    3. Dmitry Krass & O. J. Vrieze, 2002. "Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 545-566, August.
    4. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    5. K. Helmes & R. H. Stockbridge, 2000. "Numerical Comparison of Controls and Verification of Optimality for Stochastic Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 106(1), pages 107-127, July.
    6. Guillot, Matthieu & Stauffer, Gautier, 2020. "The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective," European Journal of Operational Research, Elsevier, vol. 285(1), pages 148-158.
    7. Dijk, N.M. van, 1989. "Truncation of Markov decision problems with a queueing network overflow control application," Serie Research Memoranda 0065, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    8. Nicolas Gast & Bruno Gaujal & Kimang Khun, 2023. "Testing indexability and computing Whittle and Gittins index in subcubic time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 391-436, June.
    9. Durango-Cohen, Pablo L. & Madanat, Samer M., 2008. "Optimization of inspection and maintenance decisions for infrastructure facilities under performance model uncertainty: A quasi-Bayes approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(8), pages 1074-1085, October.
    10. Prasenjit Mondal, 2020. "Computing semi-stationary optimal policies for multichain semi-Markov decision processes," Annals of Operations Research, Springer, vol. 287(2), pages 843-865, April.
    11. Warren B. Powell, 2016. "Perspectives of approximate dynamic programming," Annals of Operations Research, Springer, vol. 241(1), pages 319-356, June.
    12. Alexander Zadorojniy & Guy Even & Adam Shwartz, 2009. "A Strongly Polynomial Algorithm for Controlled Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 992-1007, November.
    13. Chen Shaoxiang, 2004. "The Infinite Horizon Periodic Review Problem with Setup Costs and Capacity Constraints: A Partial Characterization of the Optimal Policy," Operations Research, INFORMS, vol. 52(3), pages 409-421, June.
    14. Durango-Cohen, Pablo L., 2007. "A time series analysis framework for transportation infrastructure management," Transportation Research Part B: Methodological, Elsevier, vol. 41(5), pages 493-505, June.
    15. Guy Even & Alexander Zadorojniy, 2012. "Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks," Annals of Operations Research, Springer, vol. 201(1), pages 159-167, December.
    16. Vivek S. Borkar & Vladimir Gaitsgory, 2019. "Linear Programming Formulation of Long-Run Average Optimal Control Problem," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 101-125, April.
    17. José Niño-Mora, 2020. "A Fast-Pivoting Algorithm for Whittle’s Restless Bandit Index," Mathematics, MDPI, vol. 8(12), pages 1-21, December.
    18. Ali Dogramaci & Nelson M. Fraiman, 2004. "Replacement Decisions with Maintenance Under Uncertainty: An Imbedded Optimal Control Model," Operations Research, INFORMS, vol. 52(5), pages 785-794, October.
    19. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    20. Sonin, Isaac M., 2008. "A generalized Gittins index for a Markov chain and its recursive calculation," Statistics & Probability Letters, Elsevier, vol. 78(12), pages 1526-1533, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:63-94:10.1007/s10479-011-1047-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.