KNUSTSpace >
Theses / Dissertations >
College of Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/3915

Title: Cutting Stock Problem Based on the Linear Programming Approach
Authors: Debrah, Philip
Keywords: Linear programming
One-dimensional Cutting Stock Problem
knapsack problem
simplex algorithm
dynamic programming
Issue Date: 14-Jun-2011
Abstract: This thesis considers the application of the Cutting Stock Problem based on the Linear Programming Approach. This is applied in the cutting of paper, glass, steel rod, wood etc. In this thesis, we apply a variant of it, the One-dimensional Cutting Stock Problem, to the cutting of wood in a sawmill. In a sawmill, boards are first cut along their width (rip) into strips, then the obtained strips are cut along their length (strip cut) into cut-pieces with specific length and demand. The thesis focuses on using simplex algorithm to find optimal cutting patterns. In the simplex algorithm, to determine the entering column (pattern), we solve sub-problem. The sub-problem is of a knapsack type and we solve it using dynamic programming. We develop a computer program based on the above approach to generate optimal cutting patterns.
Description: A thesis submitted to the Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi in partial fulfilment of the requirements for the degree of Master of Science Industrial Mathematics, 2011
URI: http://hdl.handle.net/123456789/3915
Appears in Collections:College of Science

Files in This Item:

File Description SizeFormat

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback