A linear programming application to the cutting stock problem of ABC Corrugated Box Manufacturing Company
Date of Publication
1986
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Applied Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This study discusses some general one-dimensional and two-dimensional cutting stock problems along with their linear programming formulations. It tries to find an optimal cutting pattern that cuts large sheets of corrugated paper of given dimensions into smaller ordered box sizes with a minimum scrap which ultimately results in the reduction of total production cost of ABC Corrugated Box Manufacturing Company. The linear programming method is used where the objective function involves scrap minimization.
Abstract Format
html
Language
English
Format
Accession Number
TU05764
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
57 leaves
Keywords
Linear programming; Cutting; Boxes--Manufacture
Recommended Citation
Cheng, G. U., & Chua, T. O. (1986). A linear programming application to the cutting stock problem of ABC Corrugated Box Manufacturing Company. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15998
