IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v30y1982i2p400-403.html
   My bibliography  Save this article

Coupled Successive Approximations for Markov Programs

Author

Listed:
  • Bennett L. Fox

    (Université de Montréal, Montréal, Quebec, Canada)

Abstract

Each Markov program corresponds to a pair of linear programs. Constructing successive approximations for the primal and dual variables that are respectively decreasing and increasing allows a mutual stopping criterion based on LP duality. This assumes that ordinary successive approximations have determined an optimal or ϵ-optimal policy but not its value function (exactly). The dual variables approximated are those corresponding to the policy used. In this sense, the dual-variable approximation scheme is piggybacked onto the primal-variable approximation scheme. In another sense, the two schemes are coupled by the reciprocal termination criterion that determines when to stop refining the estimates of both the primal and dual variables.

Suggested Citation

  • Bennett L. Fox, 1982. "Coupled Successive Approximations for Markov Programs," Operations Research, INFORMS, vol. 30(2), pages 400-403, April.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:2:p:400-403
    DOI: 10.1287/opre.30.2.400
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.2.400
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.2.400?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
    ---><---

    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:inm:oropre:v:30:y:1982:i:2:p:400-403. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.