IDEAS home Printed from https://ideas.repec.org/a/oup/ajagec/v50y1968i1p111-129..html
   My bibliography  Save this article

Linear and Dynamic Programming in Markov Chains

Author

Listed:
  • Yoav Kislev
  • Amotz Amiad

Abstract

Some essential elements of the Markov chain theory are reviewed, along with programming of economic models which incorporate Markovian matrices and whose objective function is the maximization of the present value of an infinite stream of income. The linear programming solution to these models is presented and compared to the dynamic programming solution. Several properties of the solution are analyzed and it is shown that the elements of the simplex tableau contain information relevant to the understanding of the programmed system. It is also shown that the model can be extended to cover, among other elements, multiprocess enterprises and the realistic cases of programming in the face of probable deterioration of the productive capacity of the system or its total destruction.

Suggested Citation

  • Yoav Kislev & Amotz Amiad, 1968. "Linear and Dynamic Programming in Markov Chains," American Journal of Agricultural Economics, Agricultural and Applied Economics Association, vol. 50(1), pages 111-129.
    • Handle: RePEc:oup:ajagec:v:50:y:1968:i:1:p:111-129.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.2307/1237875
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Talpaz, Hovav, 1982. "Multiperiod Optimization: Dynamic Programming Vs. Optimal Control: Discussion," Western Journal of Agricultural Economics, Western Agricultural Economics Association, vol. 7(2), pages 1-6, December.

    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:oup:ajagec:v:50:y:1968:i:1:p:111-129.. 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: Oxford University Press (email available below). General contact details of provider: https://edirc.repec.org/data/aaeaaea.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.