IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v9y1961i6p849-859.html
   My bibliography  Save this article

A Linear Programming Approach to the Cutting-Stock Problem

Author

Listed:
  • P. C. Gilmore

    (International Business Machines Corporation, Research Center, Yorktown, New York)

  • R. E. Gomory

    (International Business Machines Corporation, Research Center, Yorktown, New York)

Abstract

The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. This same difficulty persists when only an approximate solution is being sought by linear programming. In this paper, a technique is described for overcoming the difficulty in the linear programming formulation of the problem. The technique enables one to compute always with a matrix which has no more columns than it has rows.

Suggested Citation

  • P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    • Handle: RePEc:inm:oropre:v:9:y:1961:i:6:p:849-859
    DOI: 10.1287/opre.9.6.849
    as

    Download full text from publisher

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

    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:oropre:v:9:y:1961:i:6:p:849-859. 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.