IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v22y1975i3p567-573.html
   My bibliography  Save this article

Denumerable state markovian sequential control processes: On randomizations of optimal policies

Author

Listed:
  • S. S. Chitgopekar

Abstract

We consider a denumerable state Markovian sequential control process. It is well known that when we consider the expected total discounted income as a criterion, there exists a nonrandomized stationary policy that is optimal. It is also well known that when we consider the expected average income as a criterion, an optimal nonrandomized stationary policy exists when a certain system of equations has a solution. The problem considered here is: if there exist two optimal nonrandomized stationary policies, will a randomization of these two policies be optimal? It is shown that in the discounted case the answer is always yes, but in the average income case, the answer is yes only under certain additional conditions.

Suggested Citation

  • S. S. Chitgopekar, 1975. "Denumerable state markovian sequential control processes: On randomizations of optimal policies," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(3), pages 567-573, September.
    • Handle: RePEc:wly:navlog:v:22:y:1975:i:3:p:567-573
    DOI: 10.1002/nav.3800220312
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800220312
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800220312?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
    ---><---

    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:wly:navlog:v:22:y:1975:i:3:p:567-573. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.