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

Strong Formulations for Multi-Item Capacitated Lot Sizing

Author

Listed:
  • Imre Barany

    (Mathematical Institute of the Hungarian Academy of Sciences, Budapest, Hungary)

  • Tony J. Van Roy

    (Center for Operations Research & Econometrics, Université Catholique de Louvain, 1348 Louvain-la-Neuve, Belgium)

  • Laurence A. Wolsey

    (Center for Operations Research & Econometrics, Université Catholique de Louvain, 1348 Louvain-la-Neuve, Belgium)

Abstract

Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems with up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generated as part of a cutting plane algorithm, and suggest a further class of inequalities that is useful for single-item capacitated problems.

Suggested Citation

  • Imre Barany & Tony J. Van Roy & Laurence A. Wolsey, 1984. "Strong Formulations for Multi-Item Capacitated Lot Sizing," Management Science, INFORMS, vol. 30(10), pages 1255-1261, October.
    • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:10:p:1255-1261
    DOI: 10.1287/mnsc.30.10.1255
    as

    Download full text from publisher

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

    inventory/production: lot sizing;

    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:30:y:1984:i:10:p:1255-1261. 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.