Product ID: Articles
Supplementary Print
Undergraduate
Waste Minirnization via Cutting Stock Models
Author: Kenneth Kalmanson and John Miller
We discuss a class of linear programming minimization models known as cutting stock, trim loss, or bin packing models. Specifically, we compare the results of applying two such models to the problem: Given certain stock lengths, how should the stocks be cut into sizes ordered by customers so as to minimize loss (of material or money) due to waste?

©1990 by COMAP, Inc.
The UMAP Journal 11.1
14 pages
Mathematics Topics:
Linear Programming
Application Areas:
Manufacturing
You must have a Full Membership to download this resource.
If you're already a member, login here.
Not yet a member?
Browse More Resources
Search