IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v106y2000i1d10.1023_a1004659107996.html
   My bibliography  Save this article

Numerical Comparison of Controls and Verification of Optimality for Stochastic Control Problems

Author

Listed:
  • K. Helmes

    (Humboldt University of Berlin)

  • R. H. Stockbridge

    (University of Kentucky)

Abstract

We provide two approaches to the numerical analysis of stochastic control problems. The analyses rely on linear programming formulations of the control problem and allow numerical comparison between controls and numerical verification of optimality. The formulations characterize the processes through the moments of the induced occupation measures. We deal directly with the processes rather than with some approximation to the processes. Excellent software is readily available, since the computations involve finite-dimensional linear programs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:106:y:2000:i:1:d:10.1023_a:1004659107996
    DOI: 10.1023/A:1004659107996
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1004659107996
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1004659107996?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. Eric V. Denardo, 1970. "On Linear Programming in a Markov Decision Problem," Management Science, INFORMS, vol. 16(5), pages 281-288, January.
    2. Alan S. Manne, 1960. "Linear Programming and Sequential Decisions," Management Science, INFORMS, vol. 6(3), pages 259-267, April.
    3. Cyrus Derman, 1962. "On Sequential Decisions and Markov Chains," Management Science, INFORMS, vol. 9(1), pages 16-24, October.
    4. Philip Wolfe & G. B. Dantzig, 1962. "Linear Programming in a Markov Chain," Operations Research, INFORMS, vol. 10(5), pages 702-710, October.
    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. P. Kaczmarek & S. Kent & G. Rus & R. Stockbridge & B. Wade, 2007. "Numerical solution of a long-term average control problem for singular stochastic processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 451-473, December.
    2. Kurt Helmes & Stefan Röhl, 2008. "A Geometrical Characterization of Multidimensional Hausdorff Polytopes with Applications to Exit Time Problems," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 315-326, May.
    3. Melda Ormeci Matoglu & John Vande Vate, 2011. "Drift Control with Changeover Costs," Operations Research, INFORMS, vol. 59(2), pages 427-439, April.

    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. 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.
    2. 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.
    3. 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.
    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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Melda Ormeci Matoglu & John Vande Vate, 2011. "Drift Control with Changeover Costs," Operations Research, INFORMS, vol. 59(2), pages 427-439, April.
    11. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    12. Ahmadi, Reza & Newby, Martin, 2011. "Maintenance scheduling of a manufacturing system subject to deterioration," Reliability Engineering and System Safety, Elsevier, vol. 96(10), pages 1411-1420.
    13. Yinyu Ye, 2005. "A New Complexity Result on Solving the Markov Decision Problem," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 733-749, August.
    14. Shanshan Guo & Lei Zhao & Xiaowei Xu, 2016. "Impact of supply risks on procurement decisions," Annals of Operations Research, Springer, vol. 241(1), pages 411-430, June.
    15. Prasenjit Mondal, 2016. "On undiscounted semi-Markov decision processes with absorbing states," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(2), pages 161-177, April.
    16. Alexander Zadorojniy & Segev Wasserkrug & Sergey Zeltyn & Vladimir Lipets, 2017. "IBM Cognitive Technology Helps Aqualia to Reduce Costs and Save Resources in Wastewater Treatment," Interfaces, INFORMS, vol. 47(5), pages 411-424, October.
    17. Reza Ahmadi, 2014. "Optimal maintenance scheduling for a complex manufacturing system subject to deterioration," Annals of Operations Research, Springer, vol. 217(1), pages 1-29, June.
    18. Mehmet U. S. Ayvaci & Oguzhan Alagoz & Elizabeth S. Burnside, 2012. "The Effect of Budgetary Restrictions on Breast Cancer Diagnostic Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 600-617, October.
    19. 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.
    20. Panagiotidou, Sofia & Nenes, George, 2009. "An economically designed, integrated quality and maintenance model using an adaptive Shewhart chart," Reliability Engineering and System Safety, Elsevier, vol. 94(3), pages 732-741.

    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:joptap:v:106:y:2000:i:1:d:10.1023_a:1004659107996. 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.