African Journal of
Mathematics and Computer Science Research

  • Abbreviation: Afr. J. Math. Comput. Sci. Res.
  • Language: English
  • ISSN: 2006-9731
  • DOI: 10.5897/AJMCSR
  • Start Year: 2008
  • Published Articles: 262

Full Length Research Paper

A Branch and Bound approach to a state government capital budgeting

N. P. Akpan1, E. H. Etuk2 and I. D. Essi2*
  1Department of Mathematics and Statistics, University of Port Harcourt, Port Harcourt, Rivers State, Nigeria. 2Department of Mathematics and Computer Science Rivers State University of Science and Technology, Port Harcourt, Rivers State, Nigeria.
Email: [email protected]

  •  Accepted: 18 April 2011
  •  Published: 31 July 2011

Abstract

 

The capital budgeting problem is a multi-constraint Knapsack problem. Hence this paper provides a solution to a capital budgeting problem of Akwa Ibom State, Nigeria using a Branch and Bound approach. The capital projects are summarized in four broad groups: The Economic sector (X1), The Social Service sector (X2), The Environmental/Regional Development sector (X3), and The Administration sector (X4 ). Using Tora software (version 11) for the analysis, it was observed that the optimal solution was found in node 60 while the upper bound and the lower bound were 154.46 and 129.76 respectively. The result shows that the second and the third sector will be selected (X1, X4 =0; X2X3=1)
 
Key words: Capital budgeting, branch and bound, Knapsack problem, capital projects

Copyright © 2024 Author(s) retain the copyright of this article.

This article is published under the terms of the Creative Commons Attribution License 4.0

Back to Vol. 4 No. 7
Back to articles
  • Articles on Google by:
SUBSCRIBE TO RSS
SUBMIT MANUSCRIPT
CONFERENCES