Research Article | OPEN ACCESS
Knapsack Model for the Project Allocation Problem (PAP): A Case of Suhum Kraboa Coaltar District
1M.K. Ofosu and 2S.K. Amponsah
1The West African Examinations Council, Accra
2Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana
Research Journal of Mathematics and Statistics 2017 2:20-25
Received: February 24, 2017 | Accepted: May 6, 2017 | Published: November 25, 2017
Abstract
Our study aimed at presenting a model for addressing the long standing problem of allocating resources to political projects in Suhum Kraboa Coaltar District Assembly. The Assembly has noticed recently in its budgetary allocation that large sums of money are allocated to projects whose benefits are stretched out over much larger time horizons than other urgent projects with short term benefits. A combined approach of benefit-cost analysis using analytical hierarchies and knapsack optimization model were used to formulate and modeled our problem in which a number of projects were to be executed by judicious allocation of available resources. The Volume Constraint method for solving knapsack problem was used to solve our problem. Our model resulted in reducing the Assembly’s allocated budgeted cost for the execution of the projects by GH¢24,000 and ensured optimal execution of the projects within the budgeted constraints. Our model contributes to the ability to make strategic allocation decision where the problem of more projects being unable to complete is addressed and where optimal resource allocation is demanded by the importance of the project. Our study is also relevant and can be applied in other districts in the country faced by similar problem in resource allocation.
Keywords:
Execution, knapsack model, optimal, optimization, project allocation, selection,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7505
ISSN (Print): 2042-2024 |
|
Information |
|
|
|
Sales & Services |
|
|
|