Branch and Bound method of solving integer programming problems (A case study of Unilorin Bakery and G. L. S. Bakery, Nigeria)
Ife Journal of Science · 26.02.2026 · 27 (3) · 127-140
DOI: 10.4314/ijs.v27i3.11s ↗Kurz gefasst
Fachartikel in der Zeitschrift Ife Journal of Science, online erschienen am 26.02.2026. Verfasst von A.W. Adelodun und 3 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, Branch and Bound method of solving integer programming problems was applied to minimize production cost and maximize profit. Numerical implementation was carried out using raw data collected from Unilorin Bakery and G. L. S. Bakery, University of Ilorin main campus, Ilorin, Nigeria. The optimal solution for the Nutritional Benefit derived from bread produced by the two main Bakeries in University of Ilorin main Campus was reached when a feasible integer solution generated at a node, which indicates an objective function of 180,000 with x1 = 6 and x2 = 10. The results obtained show that the Branch and bound method is effective in solving manufacturing problems thereby maximizing output and profit.
Zitieren
APA
Adelodun, A., Aderinto, Y., Azagbaekwue, A., & Saadu, R. (2026). Branch and Bound method of solving integer programming problems (A case study of Unilorin Bakery and G. L. S. Bakery, Nigeria). Ife Journal of Science, 27(3), 127-140. https://doi.org/10.4314/ijs.v27i3.11s
Vancouver
Adelodun A, Aderinto Y, Azagbaekwue A, Saadu R. Branch and Bound method of solving integer programming problems (A case study of Unilorin Bakery and G. L. S. Bakery, Nigeria). Ife Journal of Science. 2026;27(3):127-140. doi:10.4314/ijs.v27i3.11s
BibTeX
@article{Adelodun2026,
author = {Adelodun, A.W. and Aderinto, Y.O. and Azagbaekwue, A. and Saadu, R.A.},
title = {Branch and Bound method of solving integer programming problems (A case study of Unilorin Bakery and G. L. S. Bakery, Nigeria)},
journal = {Ife Journal of Science},
year = {2026},
volume = {27},
number = {3},
pages = {127--140},
doi = {10.4314/ijs.v27i3.11s}
}
EUVIMED