A Knapsack Problem Approach for Selecting University Student Club Activities
Abstract
In educational contexts, catering to students' choices and interests in extracurricular activities is critical for increasing engagement and happiness. In this study, we show how a knapsack problem technique can be used to pick student events organised by a traditional dance group at Universiti Utara Malaysia (UUM). Interviews and questionnaires were utilised to compile a list of activities as well as students' preferences for those activities. Lingo 21.0.33 was used to construct and solve a 0-1 integer programming model that maximises students' preferences for the selected activities. Given the RM18000 cost constraint, the Bidasari Club committee would need to spend no more than RM16500 over the semester to run all seven selected activities. The knapsack approach used in this study may be useful for other organizations in decision making for item selection.
References
Ichikawa, K., Yada, K., Nakachi, N., Washio, T. (2009). Optimization of Budget Allocation for TV Advertising. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2009. Lecture Notes in Computer Science(), vol 5712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04592-9_34
Kwarteng, A. & Asante, B. (2017). Optimal Advertisement Placement Slot Using Knapsack Problem (A Case Study of Television Advertisement of Tv 3 Ghana). International Journal of Engineering Research and Applications, 07(04), 46–62. https://doi.org/10.9790/9622-0704044662
Li, X., Sun, C. & Ye, Y. Simple and fast algorithm for binary integer and online linear programming. Math. Program. 200, 831–875 (2023). https://doi.org/10.1007/s10107-022-01880-x
Padmanabhan, J. & Swagath, S. (2017). A study report on solving 0–1 knapsack problem with imprecise data,” in the 2017 International Conference on Computer Communication and Informatics, 1–6. https://doi.org/10.1109/ICCCI.2017.8117698
Soon, W., & Ye, H. Q. (2011). Currency arbitrage detection using a binary integer programming model. International Journal of Mathematical Education in Science and Technology, 42(3), 369–376. https://doi.org/10.1080/0020739X.2010.526248
Asamoah, D., Baidoo, E. & Opoku Oppong, S. (2017). Optimizing Memory using Knapsack Algorithm. International Journal of Modern Education and Computer Science, 9(5), 34–42. https://doi.org/10.5815/ijmecs.2017.05.05
