E-Jurnal Matematika
Vol 5 No 4 (2016)

PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI

GEDE SURYAWAN (Faculty of Mathematics and Natural Sciences, Udayana University)
NI KETUT TARI TASTRAWATI (Faculty of Mathematics and Natural Sciences, Udayana University)
KARTIKA SARI (Faculty of Mathematics and Natural Sciences, Udayana University)



Article Info

Publish Date
30 Nov 2016

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.

Copyrights © 2016






Journal Info

Abbrev

mtk

Publisher

Subject

Mathematics

Description

E-Jurnal Matematika merupakan salah satu jurnal elektronik yang ada di Universitas Udayana, sebagai media komunikasi antar peminat di bidang ilmu matematika dan terapannya, seperti statistika, matematika finansial, pengajaran matematika dan terapan matematika dibidang ilmu lainnya. Jurnal ini lahir ...