IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v42y2010i12p915-930.html
   My bibliography  Save this article

Dynamic-programming-based inequalities for the capacitated lot-sizing problem

Author

Listed:
  • Joseph Hartman
  • İ. Büyüktahtakin
  • J. Smith

Abstract

Iterative solutions of forward dynamic programming formulations for the capacitated lot sizing problem are used to generate inequalities for an equivalent integer programming formulation. The inequalities capture convex and concave envelopes of intermediate-stage value functions and can be lifted by examining potential state information at future stages. Several possible implementations that employ these inequalities are tested and it is demonstrated that the proposed approach is more efficient than alternative integer programming–based algorithms. For certain datasets, the proposed algorithm also outperforms a pure dynamic programming algorithm for the problem.

Suggested Citation

  • Joseph Hartman & İ. Büyüktahtakin & J. Smith, 2010. "Dynamic-programming-based inequalities for the capacitated lot-sizing problem," IISE Transactions, Taylor & Francis Journals, vol. 42(12), pages 915-930.
    • Handle: RePEc:taf:uiiexx:v:42:y:2010:i:12:p:915-930
    DOI: 10.1080/0740817X.2010.504683
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2010.504683
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2010.504683?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dogacan Yilmaz & İ. Esra Büyüktahtakın, 2023. "Learning Optimal Solutions via an LSTM-Optimization Framework," SN Operations Research Forum, Springer, vol. 4(2), pages 1-40, June.

    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:taf:uiiexx:v:42:y:2010:i:12:p:915-930. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.