Claim Missing Document
Check
Articles

Found 26 Documents
Search

IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES Saranta, Nira Nityasa; Setiawani, Susi; Prihandini, Rafiantika Megahnia; CahyaPrihandoko, Antonius; Wihardjo, Edy
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss3pp1423-1432

Abstract

Many people are interested in cookies. Due to the high consumer interest in cookies, many companies produce cookies with various variants, one of which is Rizky Bakery. The problem faced by Rizky Bakery is how to determine the amount of production of 6 types of cookies to reach the maximum profit. Rizky Bakery carries out production activities to meet high market demand and standard demand. This study constructs a model that accommodates both conditions. The model is solved by using the Branch and Bound method constraints on materials, manufacturing time, fee labor, payment for resellers, and production targets. The purpose of this research is to determine the total number program model and the optimal solution by maximizing the profit of cookie production using Branch and Bound. Optimization using the Branch and Bound method can utilize the Python programming language with a limit of 50 iterations. Data collection methods used for this research are interviews and documentation. The limitation of the problem in this research is that the model to be studied is limited to the average condition of demand is standard and when demand is high. The results of the analysis at times of high demand showed that the production of nastar cookies, castangel cookies, mawar cookies, putri salju cookies, peanut cookies, and custard cookies in 300-gram packaging respectively are 250, 45, 80, 39, 90, 150 and in 500-gram packages are 40, 10, 10, 6, 45, and 45. While, the result of standard demand in 300-gram packaging respectively are 100, 25, 50, 16, 50, 60 and the 500-gram packaging respectively are 10, 3, 10, 2, 10, 20. The profit earned when the demand is high is IDR 8,769,412.00 and the standard demand is IDR 3,769,504.00.
Analisis Teori Antrian dalam Pelaksanaan Vaksinasi Covid-19 di Puskesmas Tapen Rafiantika Megahnia Prihandini; Hilwa Ainur Rizki; Susi Setiawani
Limits: Journal of Mathematics and Its Applications Vol. 20 No. 2 (2023): Limits: Journal of Mathematics and Its Applications Volume 20 Nomor 2 Edisi Ju
Publisher : Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This study was motivated by the Covid-19 pandemic in Indonesia. As a response to the pandemic, the government provided widespread vaccination services for the public. However, the large-scale implementation of the vaccination program led to uncontrolled patient arrivals due to crowding at vaccination sites. This situation contributed to the potential spread of new clusters of the coronavirus. The research applies queuing theory to analyze several key aspects: the average number of patient arrivals, the average quality of service, and the optimization of the number of healthcare workers needed at the Tapen Health Center. The study focuses specifically on analyzing the queuing system and patient waiting times during the vaccination process. Data were collected through interviews and direct observation of the healthcare personnel involved in the Covid-19 vaccination service. The results indicate that the queuing system implemented at the Tapen Health Center has provided optimal service performance, with the capacity to serve an average of 7 to 17 people between 08:00 and 11:00 AM.
Numerical Modelling of Social Media Addiction Cases Using 15th Order Runge-Kutta Fatahillah, Arif; Prihandini, Rafiantika Megahnia; Hidayatullah, Arfan; Setiawani, Susi; Adawiyah, Robiatul
Jurnal Matematika UNAND Vol. 14 No. 4 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.14.4.400-410.2025

Abstract

The advancement of information technology has led to more and more people, especially teenagers, becoming addicted to using various social platforms. Despite being a very useful application for social interaction, the habit of spending excessive time on social media is prone to addiction so that teenagers can experience anxiety disorders, depression, health problems, and more. The purpose of this study is to determine the effectiveness of the 15th-order Runge-Kutta method in solving mathematical models in the case of social media addiction. The method used in this research uses experimental research and data collection is done by systematically observing and recording the research indicators. The research was conducted by observing the error, number of iterations, running time, and graphs. In this study, adolescents aged 15-18 years were divided into three compartment states which were modeled into mathematical equations. The results of this study indicate that the 15th order Runge-Kutta method is more effective for solving mathematical models on social media addiction compared to Ordinary Differential Equation (ODE).
COLORING r-DYNAMIC POINT ON CRICKET GRAPH Kusumawati, Nurita; Kristiana, Arika Indah; Alfarisi, Ridho; Adawiyah, Robiatul; Setiawan, Toto Bara; Prihandini, Rafiantika Megahnia
JURNAL DIFERENSIAL Vol 6 No 1 (2024): April 2024
Publisher : Program Studi Matematika, Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jd.v6i1.12191

Abstract

A graph is defined as an ordered set (V,E) where V is a non-empty set of elements called vertices and E is a set of edges which are finite and may be empty and each edge connects two different points of V(G).The r-dynamic coloring is defined as c:V(G)→{1,2,3,…,k} such that it satisfies the following conditions if uv∈V(G), then c(u)≠ c(v), and ∀v∈V(G), |c(N(v))|≥min⁡{r,d(v)}, for positive integers r and degree of vertex v. The purpose of r-dynamic coloring is to find the minimum chromatic number of graph coloring with unlimited parameter r. Dynamic coloring is performed on cricket graphs because no research has been done before. The method used in this research is the axiomatic deductive research method and the pattern detection method.
BILANGAN KROMATIK GRACEFUL PADA KELUARGA GRAF SENTRIPETAL Lestari, Deninta Dwi Ayu; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia; Alfarisi, Ridho; Setiawan, Toto Bara; Adawiyah, Robiatul
JURNAL DIFERENSIAL Vol 6 No 1 (2024): April 2024
Publisher : Program Studi Matematika, Universitas Nusa Cendana

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35508/jd.v6i1.12746

Abstract

One of the topics studied in graphs is graph coloring. The definition of a graceful coloring, namely $k$-elegant coloring of a graph G is the exact vertex coloring c:V(G)→{ 1,2,...,k} where k≥2 induces the exact vertex coloring c^': V(G)→ {1,2,...,k-1} which is defined by c(uv)=|c(u)-c(v)|. The exact vertex coloring c of a graph G is a graceful coloring if c is a k-elegant coloring for k∈N. The graceful chromatic number is the minimum k value where graph G has k-elegant coloring, the elegant chromatic number of graph G is denoted by X_g (G). This article will discuss graceful chromatic numbers in the centripetal graph family which includes octopus graph (O_n), sandat graph (St_n),dutch windmill graph (D_3^m) , and a volcano graph (V_n).
An Inclusive Local Irregularity Vertex Coloring of Dutch Windmill Graph Kristiana, Arika Indah; Prahastiwi, Lusi Rizzami; Prihandini, Rafiantika Megahnia
CAUCHY: Jurnal Matematika Murni dan Aplikasi Vol 8, No 2 (2023): CAUCHY: JURNAL MATEMATIKA MURNI DAN APLIKASI
Publisher : Mathematics Department, Universitas Islam Negeri Maulana Malik Ibrahim Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v8i2.17154

Abstract

Let G(V,E) is a simple and connected graph with V(G) as vertex set and E(G) as edge set. An inclusive local irregularity vertex coloring is a development of the topic of local irregularity vertex coloring. An inclusive local irregularity vertex coloring is defined by coloring the graph so that its weight value is obtained by adding up the labels of the neighboring vertex and its label. The inclusive local irregularity chromatic number is defined as the minimum number of colors obtained from coloring the vertex of the inclusive local irregularity in graph G. In this paper, we find the inclusive local irregularity vertex coloring and determine the chromatic number on the Dutch windmill graph using axiomatic deductive and pattern recognition methods. The results of this study are expected to be used as a basis for studies in the development of knowledge related to the inclusive local irregularity vertex coloring