The Malaysian government has implemented various strategies to break the chain of COVID-19 in the society, such as the implementation of enhanced movement control order (EMCO) in the red areas. To support the implementation of the government’s strategy, food distribution to all families in the affected areas must be provided. In this paper, we demonstrate how the binary knapsack model can be utilized to help a non-governmental organization (NGO) in Tawau selects the food items to be filled in the food basket with maximum budget of RM100. A binary integer programming model that maximize the total weight of the food basket is developed and solved using Lingo 12.0. Two models were developed; i) the first model was developed solely based on the budget restriction, ii) the second model add in special condition as proposed by the NGO team. The first model produces optimal solution where the NGO team can prepare a basket of 31 kilograms with total cost of RM93. On the other hand, the second model provide a food basket with a higher cost of RM98 but the total weight remain unchanged. The knapsack approach used in this study may be useful for other organizations in decision making for item selection.

1.
I.I.
Bogoch
,
A.
Watts
,
A.
Thomas-Bachli
,
C.
Huber
,
M.U.G.
Kraemer
and
K.
Khan
,
Journal of Travel Medicine
,
27
(
2
), (
2020
) available at
2.
J. T.
Wu
,
K.
Leung
, and
G. M.
Leung
,
Lancet,
395
(
10225
),
689
697
(
2020
) available at
3.
E.
Landau
and
M.
Basyir
,
New Strait Times, October 24
(
2020
), available at https://www.nst.com.my/news/nation/2020/10/634907/emco-imposed-taman-semarak-ppr-balung-oct-26-nov-8
4.
M.
Barker
and
J.
Russell
,
Food Security
12
(
4
),
865
870
(
2020
) available at
5.
S.
Abdul-Rahman
and
V. Chun
Yung
,
Recent Applications in Quantitative Methods and Information Technology
,
N.
Aziz
,
S.
Abdul-Rahman
&
N.
Zainal Abidin
, Ed.
Sintok
: (
UUM Press
,
2019
), pp.
1
24
6.
X.
Wang
,
P.
Li
, and
A.
Hawbani
, “
An Efficient Budget Allocation Algorithm for Multi-Channel Advertising
,” in
24th International Conference on Pattern Recognition (ICPR)
, (
2018
), pp.
886
-
891
. available at
7.
R.
Vaze
, “
Online Knapsack Problem Under Expected Capacity Constraint
,”
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
, (
2018
), pp.
2159
-
2167
. available at
8.
J.
Padmanabhan
and
S.
Swagath
, “
A study report on solving 0–1 knapsack problem with imprecise data
,” in
2017 International Conference on Computer Communication and Informatics, ICCCI
, (
2017
), pp.
1
6
. available at
9.
S. R.
Earnshaw
and
S. L.
Dennett
,
Pharmacoeconomics
,
21
(
12
),
839
851
(
2003
).
10.
J. M.
Eckhause
,
S. A.
Gabriel
, and
D. R.
Hughes
,
IEEE Transactions on Engineering Management
59
(
4
),
679
691
(
2012
).
11.
K.
Ichikawa
,
K.
Yada
,
N.
Nakachi
, and
T.
Washio
,
Knowledge-Based Intelligent Information & Engineering Systems
,
270
277
(
2009
).
12.
B.
Stannard
,
S.
Zahir
, and
E. S.
Rosenbloom
,
Asia-Pacific Journal of Operational Research
23
,
61
76
(
2006
).
13.
G. S.
Kearns
,
Information Resources Management Journal
17
(
1
),
37
62
(
2004
).
14.
A.
Kwarteng
,
B.
Asante
,
International Journal of Engineering Research and Applications
,
07
(
04
),
46
62
(
2017
) available at
15.
D.
Asamoah
,
E.
Baidoo
,
S. Opoku
Oppong
,
International Journal of Modern Education and Computer Science
,
9
(
5
),
34
42
(
2017
) available at
This content is only available via PDF.
You do not currently have access to this content.