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

Optimal Allocation for a Class of Finite Horizon Processes

Author

Listed:
  • Alan Seelenfreund

    (Stanford University)

Abstract

The purpose of this paper is to derive a fundamental frame of reference for the analysis of a class of multistage decision problems that have been separately treated in the literature. It is hoped that exposition of the basic structure of these problems in a general setting will provide a convenient point of departure for future investigations. Specific examples of problems in this class are the capital budgeting problem of Dorfman [Dorfman, R. 1963. Regional allocation of investment: Comment. Quart. J. Econom. (Feb.)], the warehouse problem of Dreyfus [Dreyfus, S. 1957. An analytic solution of the warehouse problem. Management Sci. 4(1, Oct.)], the price speculation model of Arrow and Karlin [Arrow, K. J., S. Karlin. 1958. Price speculation under certainty. Chapter 13 in Arrow, K. J., L. Hurwicz, H. Uzawa. Studies in Linear and Non-linear Programming. Stanford University Press, Stanford, Calif.] and the work on multistage linear programs by Dantzig [Dantzig, G. B. 1959. On the status of multistage linear programming problems. Management Sci. 2(1, Oct.)]. The special results elucidating the structure of optimal solutions to these problems may all be obtained by application of the Linearity Theorem proven in this paper.

Suggested Citation

  • Alan Seelenfreund, 1969. "Optimal Allocation for a Class of Finite Horizon Processes," Management Science, INFORMS, vol. 15(11), pages 728-738, July.
    • Handle: RePEc:inm:ormnsc:v:15:y:1969:i:11:p:728-738
    DOI: 10.1287/mnsc.15.11.728
    as

    Download full text from publisher

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

    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:15:y:1969:i:11:p:728-738. 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.