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

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

Author

Listed:
  • Yves Pochet

    (Center for Operations Research and Econometrics, Université Catholique de Louvain, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium)

  • Laurence A. Wolsey

    (Center for Operations Research and Econometrics, Université Catholique de Louvain, 34 Voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium)

Abstract

We consider two classes of multi-item lot-sizing problems. The first is a class of single stage problems involving joint machine capacity constraints and/or start up costs, and the second is a class of multistage problems with general product structure. The problems are solved as mixed integer programs based on (i) an appropriate choice of the initial problem formulation and (ii) the addition of cuts which are generated automatically by a mathematical programming system (MPSARX). Our results extend and complement those of Karmarkar and Schrage (1985), Afentakis and Gavish (1986), Eppen and Martin (1987) and Van Roy and Wolsey (1987). A major advantage of this approach is its robustness or flexibility. By using just a matrix generator and a mathematical programming system with automatic cut generation routines we can formulate and solve model variants without incurring the costs of adapting an algorithm.

Suggested Citation

  • Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    • Handle: RePEc:inm:ormnsc:v:37:y:1991:i:1:p:53-67
    DOI: 10.1287/mnsc.37.1.53
    as

    Download full text from publisher

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

    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:37:y:1991:i:1:p:53-67. 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.