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

Infinite Horizon Programs

Author

Listed:
  • Richard C. Grinold

    (University of California, Berkeley)

Abstract

Several difficulties arise when multistage optimization problems with linear constraints are extended to an infinite horizon. For linear objectives the weak duality theorem fails, duality gaps exist, complementary slackness is not a sufficient condition for optimality, and the total reward may diverge. This paper presents verifiable conditions on the problem that guarantee the existence of optimal solutions and equilibrium prices for linear and nonlinear objectives. In addition, it is ascertained that the Kuhn-Tucker conditions are sufficient for optimality if additional restrictions are imposed. If the constraints are Leontief and the objective is convex (in a maximization problem), then the existence of an extreme point optimal solution can be verified. The decision taken in each period is an extreme point of the set of solutions that are feasible in that period. The Leontief case also yields a horizon theorem. All sufficiently long finite horizon problems produce a first decision that is optimal for the infinite horizon problem.

Suggested Citation

  • Richard C. Grinold, 1971. "Infinite Horizon Programs," Management Science, INFORMS, vol. 18(3), pages 157-170, November.
    • Handle: RePEc:inm:ormnsc:v:18:y:1971:i:3:p:157-170
    DOI: 10.1287/mnsc.18.3.157
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.18.3.157
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.18.3.157?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. Ghate, Archis, 2015. "Circumventing the Slater conundrum in countably infinite linear programs," European Journal of Operational Research, Elsevier, vol. 246(3), pages 708-720.
    2. O. Zeynep Akşin, 2007. "On valuing appreciating human assets in services," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 221-235, March.
    3. 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.
    4. Nuthall, Peter L., 1980. "A Survey of Methods for Determining A Planning Horizon," Review of Marketing and Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 48(01), pages 1-15, April.
    5. 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.

    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:inm:ormnsc:v:18:y:1971:i:3:p:157-170. 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.