Modeling Site Development for Garbage Disposal as a 0-1 Knapsack Problem: a Case Study of the Sekondi-Takoradi Metropolis

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Integer programming is an important class of mathematical programming problems which is a useful tool for modelling and optimizing real-life problems. The knapsack problem is a form of integer programming problem that has only one constraint and can be used to strengthen cutting planes for general integer programs. These facts make the studies of the knapsack problems and their variants extremely important area of research in the field of operations research. This thesis seeks to apply the branch-and-bound algorithm to model site development for solid waste disposal in Sekondi-Takoradi metropolis as a 0-1 knapsack problem. The model developed could be adopted for any land site management problem that can be modelled as a single 0-1 knapsack problem. Seven sites were proposed for development and the study reveals that sites A, B, F and G should be selected to obtain an optimum output and recommend that Knapsack problem model should be adopted by the district assembly for refuse disposal management.
A Thesis submitted to the Institute of Distance Learning, Kwame Nkrumah University of Science and Technology, Kumasi in partial fulfillment of the requirements for the degree of Master of Science in Industrial Mathematics