<![CDATA[AbstrakPenelitian ini bertujuan untuk merumuskan pemodelan matematika dari produksi getuk goreng Nanang Putra dengan integer linear progamming. Algoritma BB (Branch and Bound) merupakan salah satu metode penyelesaian optimum integer linear programming yang menghasilkan variabel-variabel keputusan integer. Berdasarkan hasil penelitian, keuntungan maksimum dalam sehari yang diperoleh produsen getuk goreng Nanang Putra menggunakan algoritma BB (Branch and Bound) adalah sebesar dengan banyaknya produksi getuk goreng varian original sebanyak 200 besek, varian nangka sebanyak 146 besek, dan varian durian sebanyak 254 besek. Kata Kunci: Optimasi, Produksi, Integer Linear Programming, BB, Branch and Bound AbstractThis research aims to formulate mathematical modeling of Nanang Putra's fried getuk production with integer linear programming. The BB (Branch and Bound) algorithm is one of the integer linear programming optimum solution methods that produce integer decision variables. Based on the results of the study, the maximum profit in a day obtained by the fried getuk producer Nanang Putra using the BB (Branch and Bound) algorithm is Rp 5,990,358.00 with the amount of production of fried getuk original variant of 200 baskets, jackfruit variant of 146 baskets, and durian variant of 254 baskets. Keywords: Optimization, Production , Integer Linear Programming, BB, Branch and Bound]]>
Copyrights © 2023
