Optimisasi Keuntungan Produksi Kue pada Cake By Cece Menggunakan Algoritma Branch and Bound

This study aims to optimize the cake production profit at Cake by Cece using the Branch and Bound algorithm. The data used include raw material requirements per batch, daily raw material availability, and selling prices for three types of cakes: Cookies, Brownies, and Cinnamon Roll. The optimization model is formulated as an Integer Linear Programming problem with the objective of maximizing total daily profit. The model is solved using the simplex method followed by the Branch and Bound algorithm to obtain valid integer solutions. The results indicate that the optimal production combination is 2 batches of Cookies, 2 batches of Brownies, and 3 batches of Cinnamon Roll, yielding a maximum profit of IDR 233,000 per day. This solution satisfies all raw material constraints and is feasible for daily operational implementation. This study provides quantitative recommendations to support production decision-making in culinary sector MSMEs.