IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v12y1964i4p610-619.html
   My bibliography  Save this article

Composition Principles for Synthesis of Optimal Multistage Processes

Author

Listed:
  • L. G. Mitten

    (Department of Industrial Engineering and Management Sciences, The Technological Institute, Northwestern University, Evanston, Illinois)

Abstract

Any multistage process may be constructed by a sequence of serial and/or parallel compositions. With certain restrictions on the form of the return composition function, optimal processes may be constructed in an efficient manner from optimal subprocesses. A number of simple sufficient conditions on the return functions are given and several approximation procedures are outlined.

Suggested Citation

  • L. G. Mitten, 1964. "Composition Principles for Synthesis of Optimal Multistage Processes," Operations Research, INFORMS, vol. 12(4), pages 610-619, August.
    • Handle: RePEc:inm:oropre:v:12:y:1964:i:4:p:610-619
    DOI: 10.1287/opre.12.4.610
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.12.4.610
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.12.4.610?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. Maciej Nowak & Tadeusz Trzaskalik, 2022. "A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection," Annals of Operations Research, Springer, vol. 311(2), pages 1155-1181, April.
    2. Thomas J. Sargent & John Stachurski, 2024. "Dynamic Programming: Finite States," Papers 2401.10473, arXiv.org.
    3. Robert L. Carraway & Robert L. Schmidt & Lawrence R. Weatherford, 1993. "An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(2), pages 161-173, March.

    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:oropre:v:12:y:1964:i:4:p:610-619. 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.