IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES

  • Nira Nityasa Saranta Departement of Mathematics Education, Faculty of Teacher Training and Education, Universitas Jember, Indonesia https://orcid.org/0009-0003-7092-1657
  • Susi Setiawani Departement of Mathematics Education, Faculty of Teacher Training and Education, Universitas Jember, Indonesia
  • Rafiantika Megahnia Prihandini Departement of Mathematics Education, Faculty of Teacher Training and Education, Universitas Jember, Indonesia
  • Antonius CahyaPrihandoko Informatics Study Program, Faculty of Computer Science, UNEJ, Indonesia
  • Edy Wihardjo Departement of Mathematics Education, Faculty of Teacher Training and Education, Universitas Jember, Indonesia
DOI: https://doi.org/10.30598/barekengvol18iss3pp1423-1432
Keywords: Integer Programming, Python, Branch and Bound

Abstract

Many people are interested in cookies. Due to the high consumer interest in cookies, many companies produce cookies with various variants, one of which is Rizky Bakery. The problem faced by Rizky Bakery is how to determine the amount of production of 6 types of cookies to reach the maximum profit. Rizky Bakery carries out production activities to meet high market demand and standard demand. This study constructs a model that accommodates both conditions. The model is solved by using the Branch and Bound method constraints on materials, manufacturing time, fee labor, payment for resellers, and production targets. The purpose of this research is to determine the total number program model and the optimal solution by maximizing the profit of cookie production using Branch and Bound. Optimization using the Branch and Bound method can utilize the Python programming language with a limit of 50 iterations. Data collection methods used for this research are interviews and documentation. The limitation of the problem in this research is that the model to be studied is limited to the average condition of demand is standard and when demand is high. The results of the analysis at times of high demand showed that the production of nastar cookies, castangel cookies, mawar cookies, putri salju cookies, peanut cookies, and custard cookies in 300-gram packaging respectively are 250, 45, 80, 39, 90, 150 and in 500-gram packages are 40, 10, 10, 6, 45, and 45. While, the result of standard demand in 300-gram packaging respectively are 100, 25, 50, 16, 50, 60 and the 500-gram packaging respectively are 10, 3, 10, 2, 10, 20. The profit earned when the demand is high is IDR 8,769,412.00 and the standard demand is IDR 3,769,504.00.

Downloads

Download data is not yet available.

References

L. Handajani, Akram, L. M. Furkan, and A. Rifa’i, “Penggunaan Pemasaran Digital Pada Usaha Home Industry Kopi Lombok Di Desa Sigerongan Kabupaten Lombok Barat,” Abdi Insa., vol. 6, no. 3, pp. 409–421, 2019, doi: 10.29303/abdiinsani.v6i3.267.

Diana and N. Laila, “Strategi Pengembangan Usaha Home Industri Makanan Sebagai Peluang Pendapatan di masa Pandemi Covid 19,” Pros. Semin. Nas. Pengabdi. Masy. LPPM UMJ, vol. 1, no. 1, pp. 1–8, 2020, [Online]. Available: http://jurnal.umj.ac.id/index.php/semnaskat

S. Aini, A. J. Fikri, and R. S. Sukandar, “Optimalisasi Keuntungan Produksi Makanan Menggunakan Pemrograman Linier Melalui Metode Simpleks,” J. Bayesian, vol. 1, no. 1, pp. 1–16, 2021, [Online]. Available: https://bayesian.lppmbinabangsa.id/index.php/home/article/view/1/6

T. Aningke, D. Hartama, S. R. Andani, Solikhun, and J. T. Hardinata, “Linear Programming Metode Simpleks Dalam Optimasi Keuntungan Produksi Makanan Ringan,” Pros. Semin. Nas. Ris. Dan Inf. Sci. 2020, vol. 2, pp. 365–375, 2020, [Online]. Available: https://tunasbangsa.ac.id/seminar/index.php/senaris/article/view/184/185

A. F. C. Nisa, S. Setiawani, “OPTIMASI HASIL PRODUKSI GENTENG MENGGUNAKAN GOAL PROGRAMMING SEBAGAI MONOGRAF,” Kadikma, vol. 10, pp. 105–115, 2019.

S. Setiawani, “Metode Relaksasi Lagrange untuk Menentukan Solusi Program Bilangan Cacah,” Maj. Ilm. Mat. dan Stat., vol. 17, no. 2, pp. 49–60, 2017.

S. D. Purba and F. Ahyaningsih, “Integer Programming Dengan Metode Branch and Bound Dalam Optimasi Jumlah Produksi Setiap Jenis Roti Pada Pt. Arma Anugerah Abadi,” Karismatika, vol. 6, no. 3, pp. 20–29, 2020.

G. Lancia and P. Serafini, “Integer Linear Programming,” EURO Adv. Tutorials Oper. Res., vol. 4, no. 2, pp. 43–66, 2018, doi: 10.1007/978-3-319-63976-5_4.

T. Andarayani and R. P. Sari, “Optimalisasi Keuntungan pada Pabrik Tempe dengan Metode Grafik dan Metode Branch And Bound (Studi Kasus: Pabrik Tempe Rengasdengklok Pak Walim),” Pendidik. Tambusai, vol. 6, no. 1, pp. 3366–3375, 2022.

E. Safitri, S. Basriati, and H. Najmi, “Penerapan Metode Branch and Bound dalam Optimalisasi Produk Mebel (Studi kasus: Toko Mebel di Jalan Marsan, Panam),” Kubik J. Publ. Ilm. Mat., vol. 5, no. 1, pp. 43–53, 2020, doi: 10.15575/kubik.v5i1.8611.

P. Astuti, M. A. Wafa, and I. A. Marie, “Perancangan Sistem Informasi Perencanaan dan Pengendalian Persediaan Bahan Baku di PT. X,” J. Tek. Ind., vol. 8, no. 3, pp. 172–187, 2018, doi: 10.25105/jti.v8i3.4732.

K. PARGANIHA, “Linear Programming With Python and Pulp,” Int. J. Ind. Eng. Res. Dev., vol. 9, no. 3, pp. 1–8, 2018, doi: 10.34218/ijierd.9.3.2018.001.

Z. Kapić and F. Kulenović, “Optimization of Resource Distribution By Using Linear Optimization of Resource Distribution By Using Linear Programming in Python Programming,” Int. Sci. Conf. Prod. Eng., vol. 12, no. December, pp. 1–5, 2019.

R. T. Handayanto and H. Herlawati, “Prediksi Kelas Jamak dengan Deep Learning Berbasis Graphics Processing Units,” J. Kaji. Ilm., vol. 20, no. 1, pp. 67–76, 2020, doi: 10.31599/jki.v20i1.71.

E. Fatmawati, “Monograf Sebagai Salah Satu Cara Publikasi Buku Dari Hasil Penelitian,” IQRA` J. Ilmu Perpust. dan Inf., vol. 14, no. 1, p. 130, 2020, doi: 10.30829/iqra.v14i1.7721.

Elisa and N. Intan, Strategi Jitu Menulis Buku Monograf. Sleman: Deepublish, 2019.

Published
2024-07-31
How to Cite
[1]
N. Saranta, S. Setiawani, R. Prihandini, A. CahyaPrihandoko, and E. Wihardjo, “IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES”, BAREKENG: J. Math. & App., vol. 18, no. 3, pp. 1423-1432, Jul. 2024.
Issue
Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Section
Articles

Copyright (c) 2024 Nira Nityasa Saranta, Susi Setiawani, Rafiantika Megahnia Prihandini, Antonius CahyaPrihandoko, Edy Wihardjo

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish with this Journal agree to the following terms:

  1. Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
  2. Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
  3. Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.