Claim Missing Document
Check
Articles

Found 4 Documents
Search
Journal : Mathematical Journal of Modelling and Forecasting

Alternative Strategies to Eradicate Corruption in Indonesia with Numerical Simulation of 4th Order Runge Kutta Method on Mathematical Models Rahmadi, Deddy; Rahayu, Pipit Pratiwi
Mathematical Journal of Modelling and Forecasting Vol. 2 No. 2 (2024): December 2024
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v2i2.31

Abstract

Corruption remains a critical issue hindering Indonesia's development across various sectors, necessitating innovative approaches to combat it. This study explores alternative strategies to eradicate corruption by leveraging mathematical modeling and numerical simulations. A dynamic system representing corruption propagation is formulated, considering key variables such as enforcement intensity, public awareness, and policy effectiveness. The 4th-order Runge Kutta method simulates the model and analyzes the impact of various strategic interventions over time. The results show that the difference in initial conditions significantly affects the level of corruption, which increases or decreases in a specific time. These findings provide valuable insights for policymakers and stakeholders in designing effective, data-driven anti-corruption strategies, emphasizing the integration of rigorous mathematical tools with socio-political frameworks. The study highlights the potential of numerical simulations as a complementary approach to traditional qualitative analyses in addressing complex societal challenges like corruption.
Modeling Network Problem using Metric Dimension: Applied Algorithm on Corona Graph Rahmadi, Deddy; Ramadhani, Ilma Nindita; Dheana, Clarissa Elva; Mustamin, Miftah Aulia
Mathematical Journal of Modelling and Forecasting Vol. 2 No. 1 (2024): June 2024
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v2i1.21

Abstract

Let G be a graph is a finite set of vertices and edges.  A graph G can be defined as a pair of sets . The minimum cardinality of all distinguishing sets in a graph is called the metric dimension. The metric dimension was first introduced in 1966 by Harary and Melter. The method used in this research is deductive proof. The results obtained from this research are we determine the metric dimension of the graph resulting from the corona operation on  and obtain the result that is 2n.
Profit Optimization of Ngawen Orchid MSME Ighfirli Amanda Izzati; Aida Haya Afifah; Neisya Jamilatus Syarifah; Wakhid Fitri Albar; Deddy Rahmadi
Mathematical Journal of Modelling and Forecasting Vol. 1 No. 1 (2023): June 2023
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v1i1.5

Abstract

The Ngawen Orchid MSME (Micro, Small, and Medium Enterprise) in Ngawen Hamlet, Ngawen Village, Muntilan District, Magelang Regency is a promising business opportunity. Apart from being in great demand, ornamental orchid plants also have a very high selling value. Orchid ornamental plants that are cultivated consist of three types: Dendrobium, Cattleya, and Phalaenopsis. This study aims to optimize profits by considering the number of plants and fertilizers used. This optimal profit can be achieved by applying the science of linear programming, one of which is the simplex method. The data collection techniques used in this study were interviews and direct observation of the Ngawen Orchid MSME. Based on the results of a linear programming analysis of the number of ornamental plants of Ngawen Orchid cultivation, optimal benefits were obtained from planting 40 Cattleya and 40 Phalaenopsis types orchids and there was no need to plant Dendrobium types, to get an optimal profit of IDR 4,600,000.
On Finding Shortest Path Over Vocational High School in Yogyakarta Based on Graph Theory Algorithm Rahmadi, Deddy
Mathematical Journal of Modelling and Forecasting Vol. 1 No. 2 (2023): December 2023
Publisher : Universitas Negeri Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/mjmf.v1i2.14

Abstract

Finding shortest path is one of problem in graph theory. This research aims to apply the Dijkstra algorithm in determining the shortest route for State Vocational School (SMK) students throughout Yogyakarta. State Vocational Schools throughout Yogyakarta have several locations spread across various regions, and determining the shortest path is crucial for the efficiency of students' time and transportation. Dijkstra's algorithm was chosen because of its ability to find the shortest path in a weighted graph, which can be applied to complex networks of school trajectories. The research method involved collecting geographic data on schools, available transportation, and distance between locations. This data is used to build a weighted graph that represents the transportation network between State Vocational Schools throughout Yogyakarta. The implementation of Dijkstra's algorithm is then carried out using python programming language. We hope that the research results can provide mapping of the shortest routes between schools, minimize student travel time, and increase transportation efficiency. The practical implications of this research include the development of an information system or application that can help students, teachers and schools in planning daily trips. Apart from that, the research results can also be a basis for developing methods for determining the shortest route in the context of other schools or similar environments.