An Application of K-Set Inequalities in Integer Programming, a Case Study of a Company Based In Accra
Author(s)
Jonathan Annan , Professor Samuel Kwame Amponsah , M. K. Ofosu - , Otchere Fianko Alexander ,
Download Full PDF Pages: 74-80 | Views: 898 | Downloads: 179 | DOI: 10.5281/zenodo.3411886
Abstract
Integer programming models are mathematical models that can provide organizations with the ability to optimally obtain their goals through appropriate utilization and allocation of available resources. The knapsack problem is an integer programming problem that has only one constraint and can be used to strengthen cutting planes for general integer programs. In this research paper, we shall model an advert placement and selection slot problem of a company based in Accra as a 0-1 knapsack problem. The k-set inequality algorithm was used to solve the problem by coding it in Fortran 90.
Keywords
Integer Programming, Knapsack Problems, Advert placement, K-Set Inequality
References
i. Cheang B., Li H, Lim A, and Rodrigues B (2003). Nurse Rostering problems- a bibliographic survey. European Journal of Operations Research 151, pp 447.
ii. Hall N., Hershey J, Dessler L, and Stotts R (1992). A model for making project funding decisions at the national cancer institute. Journal of Operations Research, volume 40, no 6, November-December 1992.
iii. HamdiB. and Omer S B (2005). Capital budgeting with risk adjustment for large-scale interdependent projects. Review of social, economic and business studies, vol. 7/8, pp71-82.
iv. Jolayemi J. K. (2001). A model for scheduling projects under the condition of inflation, and under penalty and reward arrangements. Journal of Operations Research Society of South Africa, Vol. 17, No. 2, P81-99.
v. Kanniappan P. and Thangavel K (1993). An optimization model for selection of integrated rural development program. Journal of Operations Research Society of South Africa, volume 9(1), pp 13-20.
vi. Scorgings C. J. and UysP W (1995). Optimization of resource utilization at a university- an allocation problem. Journal of Operations Research Society of South Africa, volume 11(1/2), pp 4-18.
Cite this Article: