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

A Dynamic Planning Technique for Continuous Activities Under Multiple Resource Constraints

Author

Listed:
  • Mufit Ozden

    (Department of Systems Analysis, Miami University, Oxford, Ohio 45056)

Abstract

The solution technique developed in this paper integrates the simplex search algorithm into the recursive calculations of dynamic programming in order to mitigate the "curse-of-dimensionality." Since differentiation is not required as a means of optimization procedure, it is expected that this technique will have an important impact on planning problems, such as the multiple resource allocation problems which involve nondifferentiable and/or highly nonlinear performance functions. Applications of the technique to very complex problems seem to confirm the anticipated polynomial average performance.

Suggested Citation

  • Mufit Ozden, 1987. "A Dynamic Planning Technique for Continuous Activities Under Multiple Resource Constraints," Management Science, INFORMS, vol. 33(10), pages 1333-1347, October.
    • Handle: RePEc:inm:ormnsc:v:33:y:1987:i:10:p:1333-1347
    DOI: 10.1287/mnsc.33.10.1333
    as

    Download full text from publisher

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

    dynamic programming; simplex search;

    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:33:y:1987:i:10:p:1333-1347. 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.