A Linear Programming Approach to the Cutting-Stock Problem

P. C. Gilmore and R. E. Gomory
Additional contact information
P. C. Gilmore: International Business Machines Corporation, Research Center, Yorktown, New York
R. E. Gomory: International Business Machines Corporation, Research Center, Yorktown, New York

Operations Research, 1961, vol. 9, issue 6, 849-859

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.

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (261)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.6.849 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:9:y:1961:i:6:p:849-859

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().