Abstract
Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra chocolate bread, rounding chocolate bread and mattress chocolate bread) that was produced by Ramadhan Bakery by applying Branch and Bound Algorithm method. Branch and Bound Algorithm is one method to solve Integer Programming’s problems other than Cutting Plane method. Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value. As the result of this study showed that to get optimal profit, Ramadhan Bakery should produce 360 pcs of original chocolate bread, 300 pcs of extra chocolate bread, 306 pcs of rounding chocolate bread and 129 pcs of mattress chocolate bread with optimal profit amounts Rp. 1.195.624,00.. The profit will increase amounts 25,2 % than before.
Highlights
Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production
The aim of this study was to find optimal profit and optimal combination of bread production that was produced by Ramadhan Bakery by applying Branch and Bound Algorithm method
Compared with Cutting Plane method, Branch and Bound Algorithm method is more effective in determining the optimal value
Summary
Programming) adalah pemrograman linear dengan variabel berupa bilangan bulat atau integer (Taha, 1997). Selain Branch and Bound Algorithm terdapat metode lain yang dapat menyelesaikan kasus pemrograman bilangan bulat (integer) yaitu algoritma bidang pemotong atau biasa disebut algoritma Cutting Plane. Di antara kedua metode tersebut, Branch and Bound Algorithm adalah metode yang nilai pemecahannya lebih optimal dibandingkan dengan algoritma Cutting Plane dari segi hasil pemecahannya (Taha, 1997). Beberapa kasus optimasi yang dapat diselesaikan dengan Branch and Bound Algorithm antara lain pengoptimalan jumlah produksi dan Travelling Salesman Problem (TSP). Sebagai hasil dari penelitian Alamnuariputri diperoleh bahwa solusi bulat optimum jumlah produksi produk saniter yang dihasilkan dari Branch and Bound Algorithm lebih maksimal dibandingkan algoritma Cutting Plane. Oleh karena itu akan diterapkan Branch and Bound Algorithm untuk mendapatkan jumlah produksi optimum roti di Ramadhan Bakery per harinya sehingga diperoleh keuntungan maksimal
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
