Computer Science and Information Technologies

Vol. 4, No. 1, March 2023, pp. 50~58

ISSN: 2722-3221, DOI: 10.11591/csit.v4i1.pp50-58  50

Optimization of bakery production by using branch and bound

approach

Rahimullaily, Rahmadini Darwas, Ratih Purwasih

Department of Information System, Metamedia University, Padang City, Indonesia

Article Info ABSTRACT

Article history: Mommy Ai Kitchen is one the businesses specializing in the bakery
business, producing cupcakes, birthday cakes, brownies, and donuts.
Received May 31, 2022 However, it does not optimally determine each bakery’s production quantity,
Revised Dec 29, 2022 so it offers fewer profits and becomes a problem. This research aims to find
Accepted Jan 6, 2023 the optimal production quantity so that this business maximizes profits. The
method used was integer programming using the branch and bound
approach, which counts the decision variable value using the simplex
Keywords: method. This research was based on the number of raw materials on hand-
wheat flour, sugar, eggs, modal, and the profits of each bakery. Based on the
Bakery analysis of the branch and bound approach, it was known that the maximum
Branch and bound profit value was IDR 253,200, with eight alternative options for the bakeries
Integer programming that were produced. One of them was Mommy Ai Kitchen, which could
Optimization produce three cupcakes, five birthday cakes, one brownie, and nine donuts to
get that maximum profit. Meanwhile, Mommy Ai Kitchen’s estimation
could produce one cupcake, one brownie, and six donuts using available
materials with a profit of IDR 78,800. As a result, the profit difference
before and after integer programming was IDR 174,400.
This is an open access article under the CC BY-SA license.

Corresponding Author:
Rahimullaily
Department of Information System, Metamedia University
Padang City, Indonesia
Email: [email protected]

1. INTRODUCTION
Bakery products are instant foods that are popular with the public because they are more readily
consumed and able to give adequate nutrients. Their taste, shape, and texture distinguish many bakery
variants of products. The statistical data of the Ministry of Agriculture said that the consumption of fresh
bread, sweet bread, and cookies had been increasing for five years (2014-2018). It reached the highest rise
among the other foods, with a percentage rise of almost 500% for the last five years (2014-2018), followed
by other bakery products, for example, cookies and other variants of bread. This case caused people’s interest
in bakery products to increase continually, pushing the bakery business growth in Indonesia. Bakeries have
run into significant growth in the last few years and are essential commodities today [1]. The COVID-19
pandemic has significantly affected all kinds of businesses, including economic businesses in Indonesia.
Government policy regarding the restriction of people’s activities has an impact on the industry. Meanwhile,
changing people’s eating patterns that make baking their primary interest and main food can save the bakery
business [2], [3].
The bakery business tries to survive by focusing on developing the products and activities and
obtaining profits optimally since its business has tough competitors in pandemic situations. Many
competitors in the business mean merchants or businessmen must have the right strategy so that the aim of

Journal homepage: http://iaesprime.com/index.php/csit

Comput Sci Inf Technol ISSN: 2722-3221  51

the business goes well and obtain maximum profits [4]. Therefore, businessmen often face many problems in
achieving their business goals. Usually, the problem is how to figure out the best number of products based
on available resources in order to increase the maximum profit [5].
Mommy Ai Kitchen is one business that is still in the bakery business and is still running its
business in the pandemic situation. It is located at Pasar Merah Street, Medan City, North Sumatra.
Cupcakes, cookies, birthday cakes, and donuts are examples of bakery products. According to the data on the
Industry Service’s site page in Medan City, there are 153 cake and bread businesses, both small and medium-
sized businesses. Mommy Ai Kitchen is not the only bakery business; competition among bakery businesses
has become more intense. Consequently, it must be able to solve every problem to survive and develop. One
of the problems is that this business does not have a method to determine the production quantity of each
bakery, so it can not obtain maximum profits. In addition, the raw materials of wheat flour, sugar, eggs, and
capital become problems in the production process. Therefore, it is necessary to allocate the raw materials
and modal so that it can maximize the profits.
One of the many methods that can help obtain maximum profits is linear programming. The linear
programming method was the most recent method used during World War II [6]. The word “linear” is used
to show the functions of mathematics in linear form. Meanwhile, programming is not about computer
programming but specific mathematical techniques [7]. Linear programming is a mathematical technique to
determine the solution to a problem that aims to maximize and minimize (optimization) something limited by
limitations [8], [9]. There are three main elements to solve the production problem. They are (1) decision
variable (it does not have a negative value to make it consistent with the real-life application), (2) objective
function (maximum and minimum), and (3) constraint function (or the limitation of resources) that must have
linear characteristics in linear programming [10]. According to Basrati [11] and Oladejo [12], the standard
form of the linear programming result with the maximum objective function is,

n
z = ∑j=1 cj xj (1)

with the constraints,

∑nj=1 aij xj ≤ bi (2)

xj ≥ 0 (3)

for and i = 1, 2, …, m and j = 1, 2, …, n

Description,
𝑧 : Maximum objective function
cj : Coefficient of the objective function
xj : Decision variable
aij : Coefficient of the decision variable
bi : Value of right side
The advantages of linear programming are that it can use many decision variables to achieve various
possibilities for optimal resource utilization. The linear programming approach is applied to determine the
feasibility of decision variables [13]. Linear programming can solve various problems, including finding the
shortest part on the graph, maximizing network flow, transportation problems, task problems, portfolio
optimization, dynamic programming, and integer programming [6], [14]. Integer programming is one of the
linear programming languages where some or all decision variables must be non-negative integers [15]. All
decision variables must be non-negative integers. These are called pure integer programming problems. All
decision variables have a value of 0, meaning “no,” or 1, meaning “yes.” They are called binary integers.
Some decision variables are required to be integers, and others are fractions. These are called mixed integer
programming problems [16]. For example, Mommy Ai Kitchen’s problem is seen as pure integer
programming because all production quantities of cupcakes, birthday cakes, brownies, and donuts require the
result to be integers to achieve maximum profits. One of the problem-solving methods of integer
programming is by using the branch and bound approach. The branch and bound approaches were found in
Balas in 1977. It was a sequential solution that divided the space into subsets (certain branches) [17]. In
addition, according to Taylor [18] branch and bound were a solution approach that divided feasible solution
space into smaller subsets of solutions. They are applied repeatedly to form the search tree and the bounding
process is applied by determining the optimal solution.

Optimization of bakery production by using branch and bound approach (Rahimullaily)

52  ISSN: 2722-3221

This research is based on the previous study by Megan Ryan and his friends entitled “Optimization
of Pia Cake products by using integer programming method in small and medium enterprises’ XYZ in Waru
Rejo Gempol Pasuruan Village.” The result of the research was integer programming method could be used
to optimize the profits of two sizes of pia cake (small and big pia cakes) for each type of pia in small and
medium enterprises’ XYZ [5]. In addition, Ammar and Emsimir used integer programming to optimize
production planning in a company. Integer programming could optimize the profits of two kinds of products
[19]. This research aims to optimize the production profits using integer-programming methods by forming
linear programming with the profits of four bakeries’ products as its objective function.

2. METHOD
Bakery production data at Mommy Ai Kitchen in 2021 were used in this research. It is primary data.
Primary data is collected by researchers directly from sources through interviews, questionnaires, calls, and
others [20]. This primary data were collected by interviewing the owner of Mommy Ai Kitchen. This
optimization uses a number from the beginning of data collection and analysis until the optimization result is
collected so that the research approach is quantitative research. The method used in this research was the
integer-programming model using the branch and bound approach, beginning with calculating the value of
the decision variable using simplex methods. The implementation was done by using the quantitative method
(QM) for Windows software.

2.1. Simplex method

Simplex is a technique for solving linear programming problems with many decision variables and
constraints. George Dantzig developed the method in 1946. It provides a systematic way to check the
solution point in the feasible part to determine the optimal value from the objective function. In this method,
someone continues the steps from a basic feasible solution to others so that the objective function always
increases [21]. The result of using the simplex method is that it collects better value to maximize profits [22].

2.2. Integer linear programming

Linear programming with the additional requirement of constraints to force the decision variables
must have or become integer values [23]. One example is a variable that is defined as the number of people
or objects, because the number of people or objects is definitely an integer, not and cannot be a fraction.
Integer linear programming is a type of optimization problem where the variables are integer values and the
objective function and equations are linear. According to Basriati [11], the general form of integer linear
programming with the maximum objective function is,
Maximum,

z = ∑nj=1 cj xj (4)

Constraint,

∑nj=1 a ij xj ≤ bi (5)

xj ≥ 0, integer for each xj (6)

for and i = 1, 2, …, m and j = 1, 2, …, n

There are three types of integer linear programming models,
a. Pure integer programming is used if all decision variables are expected to have a non-negative integer
value.
b. Binary integer programming is used if all decision variables have a value of 0, which means “no,” or 1
means “yes.”
c. Mixed integer programming is used if decision variables are expected to have integer values and contain
fraction values.

2.3. Branch and bound approach

One of the common approaches used to solve constrained optimization problems is known as the
branch and bound approach. This approach can solve the integer linear programming problem, where cost
functions are based on relaxation for linear programming problems [24], [25]. The steps in solving integer
programming by using the branch and bound approach are,

Comput Sci Inf Technol, Vol. 4, No. 1, March 2023: 50-58

Comput Sci Inf Technol ISSN: 2722-3221  53

a. Solving the problems by using the simplex method without the integer constraints.
b. Checking its optimal solution. If the decision variable is an integer, then the optimal solution has been
achieved. If it is not an integer, then continue to the third step. Choosing the variable with the huger
fraction value (The enormous decimal number) from each variable to be branched into sub-problems.
c. Making the solution of step one as the upper limits and a solution of its decision variable that has been
rounded.
d. Solving a linear programming model with the new constraints added to each sub-problem.
e. A feasible integer solution is as good as or better as the upper bound for each searched sub-problem. If
this solution occurs, a sub-problem with the upper bound must be returned to step four.
The steps that are done in finishing this research as shown in Figure 1 are,
a. Interviewing the owner of Mommy Ai Kitchen to recognize and learn about their problems.
b. Data collection and problem identification. Collecting the data of the total raw material needed from
each bakery product (cupcake, birthday cake. Brownies, and donuts) and the total available capital.
Making integer programming modal in determining the number of bakery products and achieving the
maximum profits are problem identification in this research.
c. Problem formulation and research purposes. The problem formulation in this research is how to make
an integer-programming model that can represent the system that occurs. In addition, the research aims
to determine the bakery product quantity optimally and obtain maximum profits.
d. Designing a program model. The model was designed after getting the information and the data. The
model, which has been designed, will provide an abstraction with structural elements and operation
between elements that form the system.
e. Running the program. A sequence of data processes does data processing by using QM for Windows
software.
f. Analysis. Data collected and processed were analyzed to determine the number of production planning
and the profits obtained later.
g. Conclusion: The content is the solution to the problem that is formulated in the problem formulation.

Figure 1. Research method flowchart

3. MODEL FORMULATION
The raw material composition of each production dough, the stock of raw materials, the modal, and
the profits of each production data in a week are needed in this research. Data that can be collected from

Optimization of bakery production by using branch and bound approach (Rahimullaily)

54  ISSN: 2722-3221

Mommy Ai Kitchen business are shown in Table 1. Mommy Ai Kitchen does not have a method for
determining the production quantity optimally in each kind of that bakery, so with those available materials,
Mommy Ai Kitchen produces one cupcake, one birthday cake, and six donuts with Rp. 78.800 of profits in a
week. Therefore, optimization by using an integer-programming model through the branch and bound
approach to counting decision variable value by using the simplex method was analyzed in this research.
Based on Table 1, Integer-programming modeling is done by (1) determining the decision variables, (2)
creating an objective function, and (3) constraint formulations. This model is a step that needs to be done to
get an optimal solution.

Table 1. Raw material composition, stock, modal, and profits

Raw Material Competitions per portion
Products Modals per Portion (IDR) Profits per portion (IDR)
Wheat Flour (Gram) Sugar (Gram) Egg (Item)
Cupcake 95 50 2 18.000 12.000
Birthday Cake 175 150 6 51.000 34.000
Brownies 120 120 4 6.000 4.000
Donuts 150 30 2 7.200 4.800
Capacity 4.500 3.000 60 380.000

a. Determining a decision variable

The decision variable relates to determining bakery quantities that must be produced in a week. They
are,
x1 = The number of cupcakes that must be produced
x2 = The number of birthday cakes that must be produced
x3 = The number of brownies that must be produced
x4 = The number of donuts that must be produced
b. Forming an objective function
An objective function of the optimization problem is to maximize the profits from selling the fourth
kind of bakeries produced. Based on the formulation (4), the objective function formulation in this
problem can be written,
Zmax = 12.000x1 + 34.000x2 + 4.000x3 + 4.800x4
c. Constraint formulation
A constraint is consisted of raw material and its stock, for example, wheat flour, sugar, egg, and capital
stock. Based on the formulations (5) and (6), the constraints in this problem can be formed in the
equation,
Wheat flour : 95x1 + 175x2 + 120x3 + 150x4 ≤ 4.500
Sugar : 50x1 + 150x2 + 120x3 + 30x4 ≤ 3.000
Egg : 2x1 + 6x2 + 4x3 + 2x4 ≤ 60
Modal : 18.000x1 + 51.000x2 + 6.000x3 + 7.200x4 ≤ 380.000
x1 , x2 , x3 , x4 ≥ 0, and integer for x1 , x2 , x3 , x4

3.1. Integer programming application (QM for windows)

Next is to do data processing. The formed math model will be solved by using QM for Windows
software with the integer-programming module. The steps in processing data are,
a. Inputting all data formulation (Objective function and constraints) into QM for windows software as
shown in Figure 2.
b. Processing the data by clicking the solve button. Finally, display the solution from the result of the data
Input as shown in Figure 3.
Figure 3 shows the production result and the optimal profit with the limitation of the available
resource (availability of raw materials and modal) in the Brach process in the 705 th iteration. Finally, the
result of the iteration is not feasible, and the value is less than the lower limit, so it cannot be branched
anymore. Twenty-six branches/levels that are occurred in total. Besides that, based on Figure 3, the optimal
profit obtained is Rp. 253,200 per week with several choices of bakeries that are produced per week. There
are 8 choices, as shown in Table 2.

Comput Sci Inf Technol, Vol. 4, No. 1, March 2023: 50-58

Comput Sci Inf Technol ISSN: 2722-3221  55

Figure 1. The formulation of data input

Figure 2. The solution software

Optimization of bakery production by using branch and bound approach (Rahimullaily)

56  ISSN: 2722-3221

Table 1. Constraints value with optimal profit IDR 253,200

No X1 X2 X3 X4 Description
1. 3 5 1 9 The 132nd iteration, and the 11th branch
2. 5 5 1 4 The 196th iteration, and the 10th branch
3. 7 3 0 14 The 293rd iteration, and the 14th branch
4. 9 3 0 9 The 311th iteration, and 13th branch
5. 11 3 0 4 The 362nd iteration, and 14th branch
6. 10 3 3 4 The 381st iteration, and 17th branch
7. 14 1 2 9 The 524th iteration, and 20th branch
8. 16 1 2 4 The 610th iteration, and 22nd branch

4. THE ANALYSIS OF THE BRANCH AND BOUND APPROACH

In the first step, solving the problem by using the simplex method without integer constraints
obtained the solution of Zmax = IDR 253,333.3 with x1 = 0, x2 = 7,451, x3 = 0, and x4 = 0. The value of
x2 from is not an integer, so the solution is invalid, so it becomes the branch into the sub-problem, and the
profit value IDR 253,333.3 becomes the upper limit. With the down integer method x1 = 0, x2 = 7, x3 =
0, and x4 = 0with the profit IDR 238,000, this result is feasible because both variables are integers. So, the
profit value with the down integer becomes the button limit.
The first level or branch chooses the decision variable with a bigger fraction to do the branch based
on the result of the previous decision variable, x 2. x2 variable is branched to be sub-problem 1 and problem 2
with extra constraint for each sub-problem x2 ≤ 7 and x2 ≥ 8 so that is obtained the formation for sub-problem
1 and 2 as,
a. The solution to sub-problem: 1 x1 = 1,2778, x2 = 7, x3 = 0, and x4 = 0, with Zmax = IDR 253,333.3
(have not been integer and feasible)
b. The solution to sub-problem 3 is infeasible
The second level or branch, choosing the decision variable that has a bigger fraction to do the branch
base on the variable decision result in the previous sub-problem 1, is x1 ≤ 1 and x1 ≥ 2 so obtained the
formulation for subproblems 1 and 2 as,
a. The solution to sub-problem 1: x1 = 1, x2 = 7, x3 = 0, and x4 = 0,6944 with Zmax = IDR 253,333.3
(have not been integer and feasible)
b. The solution to sub-problem 2: x1 = 2, x2 = 6,7451, x3 = 0, and x4 = 0 with Zmax = IDR 253,333.3
(have not been integer and feasible)
In the third level or branch, choosing the decision variable that has a bigger fraction to do the branch
base on the result of x1 = 1, x2 = 7, x3 = 0, x4 = 0,694, and based on x1 = 2, x2 = 6,7451, x3 = 0, x4 = 0.
a. Choosing the decision variable with the bigger fraction to do the branch base on the result of x1 =
1, x2 = 7, x3 = 0, x4 = 0,694 is x4 . Variable x4 is branched to be subproblems 1 and 2 with extra
constraints for each sub-problems x4 ≤ 0 and x4 ≥ 1. So is obtained the formulation for sub-problem 1
and problem 2 as,
− The solution to sub-problem 1 : x1 = 1, x2 = 7, x3 = 0,833, and x4 = 0 with Zmax = IDR 253,333.3
(have not been integer and feasible)
− The solution to sub-problem 2: x1 = 0,8778, x2 = 7, x3 = 0, and x4 = 1 with Zmax = IDR 253,333.3
(have not been integer and feasible)
b. Choosing the variable decision with the bigger fraction to do branch base on the result ofx1 = 2, x2 =
6,7451, x3 = 0, x4 = 0 is variablex2 . Variable x2 is branched to be sub-problem 1 and sub-problem 2
with extra constraints for each sub-problem x2 ≤ 6 and x2 ≥ 7. So is obtained the formulation for
subproblems 1 and 2 as,
− The solution to sub-problem 1: x1 = 4,111, x2 = 6, x3 = 0 and x4 = 0 with Zmax: = IDR 253,333.3
(have not been integer and feasible)
− The solution to sub-problem 2 is infeasible.
The branch and bound above analysis can be drawn in the schema shown in Figure 4. Based on
Figure 4, the process of the branch and bound is continued and will be finished if all design variables are
integer and feasible. The problem solution uses QM for Windows, shown in Figure 4, so this branching
process finishes at the 26th level/branch, and the total iteration calculation is as many as 705.

Comput Sci Inf Technol, Vol. 4, No. 1, March 2023: 50-58

Comput Sci Inf Technol ISSN: 2722-3221  57

Figure 3. The process of the branch and bound approach

5. CONCLUSION
Mommy Ai Kitchen business has some constraints that are occurred in the production process, for
example, the availability of wheat flour, sugar, egg, and capital. Therefore, production planning (to allocate
the raw material and modal) and maximizing the business profit can be seen as an integer-programming
problem. Determining the total of bakery products by using the branch and bound approach helps Mommy Ai
Kitchen determine the production total in each bakery to obtain the maximum profit. Mommy Ai Kitchen
will obtain the maximum profit of IDR 253,200 per week with some of the choices of the total of bakeries
that are produced. First, 3 cupcakes, 5 birthday cakes, 1 brownie, and 9 donuts. Second, 5 cupcakes, 5
birthday cakes, 1 brownie, and 4 donuts. Third, 7 cupcakes, 3 birthday cakes, 0 brownies, and 14 donuts.
Fourth, 9 cupcakes, 3 birthday cakes, 0 brownies, and 9 donuts. Fifth, 11 cupcakes, 3 birthday cakes, 0
brownies, and 4 donuts. Sixth, 10 cupcakes, 3 birthday cakes, 3 brownies, and 4 donuts. Seventh, 14
cupcakes, 1 birthday cake, 2 brownies, and 9 donuts. Eighth, 16 cupcakes, 1 birthday cake, 2 brownies, and 4
donuts. While the estimation of Mommy Ai Kitchen, with the available material, can produce 1 cupcake, 1
birthday cake, 1 brownie, and 6 donuts with a profit of IDR 78,800. So, the deviation of the previous profit
from the profit after using the integer programming method is IDR 174,400.

ACKNOWLEDGEMENTS
On this occasion, we would like to thank the Amal Bakti Mukmin Padang Foundation, Metamedia
University, for providing financial support in writing this journal completion.

REFERENCES
[1] S. Kiumarsi, K. Jayaraman, S. M. Isa, and A. Varastegani, “Marketing strategies to improve the sales of bakery products of small-
medium enterprise (SMEs) in Malaysia,” International Food Research Journal, vol. 21, no. 6, pp. 2101–2107, 2014.
[2] H. Akhmadi, Z. F. Q. Aini, A. Saffana, and D. Runanto, “Online Purchase Behaviour of Food Product During Covid-19
Pandemic: a Study on Consumer of Bedukmutu Marketplace,” E3S Web of Conferences, vol. 316, p. 1013, 2021, doi:
10.1051/e3sconf/202131601013.
[3] C. D. Virginio et al., “Overcoming Challenges in the Quality Service and Production of a Bakery Business: A Literature Review,”
{SSRN} Electronic Journal, 2022, doi: 10.2139/ssrn.4031633.
[4] N. Tien, “The role of international marketing in international business strategy,” International Journal of Research in Marketing
Management and Sales, vol. 1, no. 2, pp. 134–138, 2020.
[5] M. R. Kevin and K. Rosyidi, “Optimization of Pia Cake Production Using The Integer Programming Method at XYZ UKM,
Waru Rejo Gempol Pasuruan Village,” Journal Knowledge Industrial Engineering (JKIE), vol. 04, no. 01, pp. 23–32, 2017.
[6] Y. M. R. Aboelmagd, “Linear programming applications in construction sites,” Alexandria Engineering Journal, vol. 57, no. 4,
pp. 4177–4187, Dec. 2018, doi: 10.1016/j.aej.2018.11.006.
[7] G. Dantzig, Linear Programming and Extensions. {RAND} Corporation, 1963. doi: 10.7249/r366.
[8] D. R. Indah and P. Sari, “Application of linear programming model to optimize production amount in obtaining maximum profit
(Case study on angga furniture business),” J. Manaj. Inov., vol. 10, no. 2, pp. 98–115, 2019, doi: 10.24815/JMI.V10I2.16001.
[9] K. Murota, “Linear programming,” Computer Vision: A Reference Guide, pp. 1–7, 2019, doi: 10.1007/978-3-030-03243-2_648-1.
[10] A. H. Hamadi, R. J. Mitlif, M. Rasheed, S. Shihab, T. Rashid, and S. A. Hamad, “Linear programming method application in a
solar cell,” J. Al-Qadisiyah Comput. Sci. Math., vol. 13, no. 1, pp. 10–21, 2021, doi: 10.29304/jqcm.2021.13.1.740.
[11] S. Basriati, “Integer linear programming with cutting plane and branch and bound approaches for optimizing tofu production,”
EURO Advanced Tutorials on Operational Research, pp. 43–66, 2018.
[12] N. K. Oladejo, A. Abolarinwa, S. O. Salawu, A. F. Lukman, and H. I. Bukari, “Optimization principle and its’ application in
optimizing landmark university bakery production using linear programming,” International Journal of Civil Engineering and
Technology, vol. 10, no. 2, pp. 183–190, 2019.
[13] M. Bhatia and A. Rana, “A Mathematical Approach to Optimize Crop Allocation {\textendash} A Linear Programming Model,”

Optimization of bakery production by using branch and bound approach (Rahimullaily)

58  ISSN: 2722-3221

International Journal of Design &amp$\mathsemicolon$ Nature and Ecodynamics, vol. 15, no. 2, pp. 245–252, Apr. 2020, doi:
10.18280/ijdne.150215.
[14] J. A. De Loera, “Algebraic and Topological Tools in Linear Optimization,” Notices of the American Mathematical Society, vol.
66, no. 07, p. 1, Aug. 2019, doi: 10.1090/noti1907.
[15] G. Khalili, S. Nasseri, and N. Taghi-Nezhad, “A new interactive approach for solving fully fuzzy mixed integer linear
programming,” Yugoslav Journal of Operations Research, vol. 30, no. 1, pp. 71–89, 2020, doi: 10.2298/yjor181015025k.
[16] W. Hare, Y. Lucet, and F. Rahman, “A mixed-integer linear programming model to optimize the vertical alignment considering
blocks and side-slopes in road construction,” European Journal of Operational Research, vol. 241, no. 3, pp. 631–641, Mar.
2015, doi: 10.1016/j.ejor.2014.08.035.
[17] F. Theurich, A. Fischer, and G. Scheithauer, “A branch-and-bound approach for a Vehicle Routing Problem with Customer
Costs,” {EURO} Journal on Computational Optimization, vol. 9, p. 100003, 2021, doi: 10.1016/j.ejco.2020.100003.
[18] S. M. J. Zaidi and B. W. T. III, “Introduction to Management Science,” The Journal of the Operational Research Society, vol. 34,
no. 2, p. 174, Feb. 1983, doi: 10.2307/2581112.
[19] E. E. Ammar and A. A. Emsimir, “A mathematical model for solving integer linear programming problems,” African Journal of
Mathematics and Computer Science Research, vol. 13, no. 1, pp. 39–50, Feb. 2020, doi: 10.5897/ajmcsr2019.0804.
[20] A. Budianto, “Legal Research Methodology Reposition in Research on Social Science,” International Journal of Criminology and
Sociology, vol. 9, pp. 1339–1346, Dec. 2020, doi: 10.6000/1929-4409.2020.09.154.
[21] A. Velinov and V. Gicev, “Practical Application of Simplex Method for Solving Linear Programming Problems,” Balkan Journal
of Applied Mathematics and Informatics (BJAMI), vol. 1, no. 1, pp. 7–16, 2018.
[22] S. Shameem, “An experiment with simplex method for solving linear programming problems,” Brac University, 2022.
[23] P. Q. Pan, “Linear programming computation,” Linear Programming Computation, vol. 9783642407, no. September, pp. 1–747,
2014, doi: 10.1007/978-3-642-40754-3.
[24] A. Montanaro, “Quantum speedup of branch-and-bound algorithms,” Physical Review Research, vol. 2, no. 1, Jan. 2020, doi:
10.1103/physrevresearch.2.013056.
[25] M. Dan, S. Srinivasan, S. Sundaram, A. Easwaran, and L. Glielmo, “A Scenario-Based Branch-and-Bound Approach for {MES}
Scheduling in Urban Buildings,” {IEEE} Transactions on Industrial Informatics, vol. 16, no. 12, pp. 7510–7520, Dec. 2020, doi:
10.1109/tii.2020.2978870.

BIOGRAPHIES OF AUTHORS

Rahimullaily is a Lecturer at Department of Information System, Metamedia

University, Padang City. She completed her undergraduate and postgraduate education at the
Department of Mathematics, Andalas University. She can be contacted at email:
[email protected].

Rahmadini Darwas is a Lecturer at Department of Information System,

Metamedia University, Padang City. She has completed her undergraduate and postgraduate
education at the Department of Information Systems, Gunadarma University. She obtained a
Certified Information Technology Auditor Professional (CITAP) in May 2022 issued by
Motekar Edukasi Indonesia. She can be contacted at email: [email protected].

Ratih Purwasih is a Lecturer at Department of Information System, Metamedia

University, Padang City. She has completed her magister degree at the Department of
Linguistics, Andalas University. She can be contacted at email:
[email protected].

Comput Sci Inf Technol, Vol. 4, No. 1, March 2023: 50-58