IMPLEMENTASI ALGORITMA BRANCH AND BOUND DAN REDUKSI VARIABEL DALAM OPTIMASI KEUNTUNGAN PRODUKSI

Hanny Puspha Jayanti, NIM.: 19106010004 (2023) IMPLEMENTASI ALGORITMA BRANCH AND BOUND DAN REDUKSI VARIABEL DALAM OPTIMASI KEUNTUNGAN PRODUKSI. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (IMPLEMENTASI ALGORITMA BRANCH AND BOUND DAN REDUKSI VARIABEL DALAM OPTIMASI KEUNTUNGAN PRODUKSI)
19106010004_BAB-I_IV-atau-V_DAFTAR-PUSTAKA.pdf - Published Version

Download (2MB) | Preview
[img] Text (IMPLEMENTASI ALGORITMA BRANCH AND BOUND DAN REDUKSI VARIABEL DALAM OPTIMASI KEUNTUNGAN PRODUKSI)
19106010004_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf
Restricted to Registered users only

Download (4MB) | Request a copy

Abstract

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.

Item Type: Thesis (Skripsi)
Additional Information: Pembimbing: Muchammad Abrori, S.Si., M.Kom.
Uncontrolled Keywords: integer linear programming; Branch and Bound Algorithm; variable reduction algorithm
Subjects: Matematika
Divisions: Fakultas Sains dan Teknologi > Matematika (S1)
Depositing User: Muchti Nurhidaya [muchti.nurhidaya@uin-suka.ac.id]
Date Deposited: 09 May 2023 10:03
Last Modified: 09 May 2023 10:03
URI: http://digilib.uin-suka.ac.id/id/eprint/58411

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum