IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-1356-7_6.html
   My bibliography  Save this book chapter

Dynamic Programming

In: Interactive Operations Research with Maple

Author

Listed:
  • Mahmut Parlar

    (McMaster University, DeGroote School of Business)

Abstract

Dynamic programming (DP) is a simple yet powerful approach for solving certain types of sequential optimization problems. Most real-life decision problems are sequential (dynamic) in nature since a decision made now usually affects future outcomes and payoffs. An important aspect of optimal sequential decisions is the desire to balance present costs with the future costs. A decision made now that minimizes the current cost only without taking into account the future costs may not necessarily be the optimal decision for the complete multiperiod problem. For example, in an inventory control problem it may be optimal to order more than the current period’s demand and incur high inventory carrying costs now in order to lower the costs of potential shortages that may arise in the future. Thus, in sequential problems it may be optimal to have some “short-term pain” for the prospect of “long-term gain.”

Suggested Citation

  • Mahmut Parlar, 2000. "Dynamic Programming," Springer Books, in: Interactive Operations Research with Maple, chapter 6, pages 193-235, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-1356-7_6
    DOI: 10.1007/978-1-4612-1356-7_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4612-1356-7_6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.