TY  - THES
N1  - Pembimbing: Muchammad Abrori, S.Si., M.Kom.
ID  - digilib58411
UR  - https://digilib.uin-suka.ac.id/id/eprint/58411/
A1  - Hanny Puspha Jayanti, NIM.: 19106010004
Y1  - 2023/02/16/
N2  - Linear Programming (LP) cannot answer production problems that require
decision variables to be in the form of integers. For this reason, Integer Linear
Programming (ILP) exists as a special case of Linear Programming (LP) which
can answer problems with decision variables in the form of integers. This research
is intended to determine the difference in output values and the number of
iterations used in the Branch and Bound Algorithm and Variable Reduction to
solve the problem of maximizing production profits. The Branch and Bound
Algorithm divides the problem into sub-problems (branching) that lead to a
solution by forming a search tree structure and bounding to reach the optimum
solution. Meanwhile, the Variable Reduction Algorithm involves moving the
decision variables from the left side to the right side of the constraint function.
This research will use data from the Rembang Dairy Industry, with the problem of
wanting to get maximum profit. Using the help of Maple Software, the settlement
using the Branch and Bound and Variable Reduction Algorithm produces the
same profit, which is IDR 14,786,548. However, the calculation process using the
Variable Reduction Algorithm requires more iterations than the Branch and
Bound Algorithm.
PB  - UIN SUNAN KALIJAGA YOGYAKARTA
KW  - integer linear programming; Branch and Bound Algorithm; variable
reduction algorithm
M1  - skripsi
TI  - IMPLEMENTASI ALGORITMA BRANCH AND BOUND DAN
REDUKSI VARIABEL DALAM OPTIMASI KEUNTUNGAN
PRODUKSI
AV  - restricted
EP  - 102
ER  -