IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v29y1983i5p583-594.html
   My bibliography  Save this article

Market Value Maximization and Markov Dynamic Programming

Author

Listed:
  • Richard C. Grinold

    (University of California, Berkeley)

Abstract

This paper shows how an operational method for solving dynamic programs can be used, in some cases, to solve the problem of maximizing a firm's market value. The problem is formulated as a Markov decision problem that can be solved via linear programming. The paper shows how to calculate (or estimate) the state-contingent prices that are used to value the firm. In addition, the paper points out how states can be aggregated to make the solution technique more practical. The paper's final section contains a specific example.

Suggested Citation

  • Richard C. Grinold, 1983. "Market Value Maximization and Markov Dynamic Programming," Management Science, INFORMS, vol. 29(5), pages 583-594, May.
  • Handle: RePEc:inm:ormnsc:v:29:y:1983:i:5:p:583-594
    DOI: 10.1287/mnsc.29.5.583
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.29.5.583
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.29.5.583?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

    Keywords

    finance; dynamic programming applications;

    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:inm:ormnsc:v:29:y:1983:i:5:p:583-594. 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.