IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/294.html
   My bibliography  Save this paper

Finite horizon approximations of infinite horizon linear programs

Author

Listed:
  • GRINOLD, Richard C.

Abstract

No abstract is available for this item.

Suggested Citation

  • GRINOLD, Richard C., 1977. "Finite horizon approximations of infinite horizon linear programs," LIDAM Reprints CORE 294, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:294
    DOI: 10.1007/BF01593765
    Note: In : Mathematical Programming, 12, 1-17, 1977
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. David R. Cariño & David H. Myers & William T. Ziemba, 1998. "Concepts, Technical Issues, and Uses of the Russell-Yasuda Kasai Financial Planning Model," Operations Research, INFORMS, vol. 46(4), pages 450-462, August.
    2. Thomas W.M. Vossen & Fan You & Dan Zhang, 2022. "Finite‐horizon approximate linear programs for capacity allocation over a rolling horizon," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 2127-2142, May.
    3. Ghate, Archis, 2015. "Circumventing the Slater conundrum in countably infinite linear programs," European Journal of Operational Research, Elsevier, vol. 246(3), pages 708-720.
    4. H. Edwin Romeijn & Robert L. Smith, 1998. "Shadow Prices in Infinite-Dimensional Linear Programming," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 239-256, February.
    5. Archis Ghate & Robert L. Smith, 2013. "A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 61(2), pages 413-425, April.
    6. L.A. Korf, 1998. "Insurer's Portfolios of Risks: Approximating Infinite Horizon Stochastic Dynamic Optimization Problems," Working Papers ir98061, International Institute for Applied Systems Analysis.
    7. Archis Ghate & Dushyant Sharma & Robert L. Smith, 2010. "A Shadow Simplex Method for Infinite Linear Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 865-877, August.
    8. Lisa Korf, 2006. "Approximating infinite horizon stochastic optimal control in discrete time with constraints," Annals of Operations Research, Springer, vol. 142(1), pages 165-186, February.

    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:cor:louvrp:294. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.