Optimization of Dimsum Production Profits Using the Branch and Bound Method

Authors

  • Qonita Putri Andini Universitas Islam Negeri Sumatera Utara
  • Ismail Husein Universitas Islam Negeri Sumatera Utara

DOI:

10.33395/sinkron.v8i3.14026

Abstract

The dimsum industry in Indonesia is currently experiencing very significant development, because many businesses offer processed dimsum products for convenient consumption. The characteristics of dimsum are varied and suitable to be served as a snack. This has created an increasing number of dimsum enthusiasts, seen from the emergence of restaurants serving dimsum menus originating from China. The aim of this research is to determine the maximum profit achieved in making dimsum using the Branch and Bound technique. Using the branch and bound method because it is a mathematical model which is a development of a linear program, where all decision variables must be integers, this method limits the optimal solution to a whole by creating an upper and lower branch for each solution which has a fractional value. to be a round value so that each restriction will produce a new branch. Based on the research results, it can be concluded that the optimal production level using the Branch And Bound method is IDR 19,054,950 per month. When compared with the profits before using the Branch and Bound method, the profits obtained were IDR 18,800,000. This shows that by using the Branch and Bound method, the profit of the Mikaila Bakery cake shop increases by IDR. 1.3% or around Rp. 254,950 per month. Sensitivity analysis shows that profits will remain at optimal conditions if changes in the objective function coefficients are less than or equal to the objective function coefficients in the initial model.

GS Cited Analysis

Downloads

Download data is not yet available.

References

Aminuddin. (2002). Prinsip-Prinsip Riset Operasi. Erlangga.

Hayati, E. N. (2010). Aplikasi Algoritma Branch and Bound untuk Menyelesaikan Integer Programming. Jurnal Dinamika Teknik, 1(1).

Magdalena, P. (2017). Optimasi Jumlah Produksi Dengan Menggunakan Metode Cutting Plane Dan Analisis Sensitivitasnya (Studi Kasus: Pt. Kilang Kecap Angsa, Jl Meranti N0. 12 Medan. FMIPA USU.

Marzukoh, A. (2017). Optimasi Keuntungan Dalam Produksi Dengan Menggunakan Linear Programming Metode Simpleks (Studi Kasus UKM Fahmi Mandiri Lampung Selatan). UIN Raden Intan Lampung.

Maslikhah, S. (2017). Metode Pemecahan Masalah Integer Programming. At-Taqaddum. 7(2), 211–226.

Sahari, A., & Aya, A. I. (2016). Optimalisasi Produksi Roti Dengan Menggunakan Metode Branch And Bound. JIMT, 13(2), 98–107.

Sauddin, A., Abidin, W., & Sumarni, W. (2015). Integer Programming Dengan Pendekatan Metode Branch And Bound Guna Mengoptimalkan Jumlah Produk Dengan Keuntungan Maksimal. Matematika Dan Statistika Serta Aplikasinya, 3(1), 45-52.

Siswanto. (2006). Operations Research. Erlangga.

Supatimah, S. S., Farida, & Andriani, S. (2019). Optimasi Keuntungan Dengan Metode Branch And Bound. Aksioma, 10(1).

Taha, H. (1997). Operation Research an Introduction. New Jersey. Hall International.

W, T. (2021). Sains Manjemen Pendekatan Matematika untuk Bisnis. Penerbit Salemba Empat (PT Salemba Emban Patria).

Wijaya, A. (2013). Pengantar Riset Operasi, 3 ed. Mitra Wacana Media.

Downloads


Crossmark Updates

How to Cite

Andini, Q. P. ., & Husein, I. . (2024). Optimization of Dimsum Production Profits Using the Branch and Bound Method. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 8(3), 2107-2115. https://doi.org/10.33395/sinkron.v8i3.14026