BAREKENG: Jurnal Ilmu Matematika dan Terapan
Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application

THE BRANCH AND BOUND APPROACH TO A BOUNDED KNAPSACK PROBLEM (CASE STUDY: OPTIMIZING OF PENCAK SILAT MATCH SESSIONS)

Ambarwati, Aditya (Unknown)
Abusini, Sobri (Unknown)
Krisnawati, Vira Hari (Unknown)

Article Info

Publish Date
11 Oct 2024

Abstract

A method commonly employed to solve integer programming problems is the Branch and Bound. In this article, maximizing the number of matches held on the first day of pencak silat tournaments is essential because it can impact the overall dynamics and results of the competition. The model used to maximize the number of match sessions in pencak silat competitions is a variant of the Bounded Knapsack Problem (BKP), belonging to the category of integer programming models. The result obtained using the Branch and Bound method ensures that the maximum number of match sessions can be conducted. The objective value obtained using the Branch and Bound method decreases as it descends, indicating a decreasing maximum value.

Copyrights © 2024




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
BAREKENG: Jurnal Ilmu Matematika dan Terapan
Website

Abbrev

barekeng

Publisher

Universitas Pattimura

Subject

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

Description

BAREKENG: Jurnal ilmu Matematika dan Terapan is one of the scientific publication media, which publish the article related to the result of research or study in the field of Pure Mathematics and Applied Mathematics. Focus and scope of BAREKENG: Jurnal ilmu Matematika dan Terapan, as follows: - Pure ...