Claim Missing Document
Check
Articles

Found 5 Documents
Search

Goal Programming Method in Optimizing Course Student Admission, Operational Costs and Profits Muhammad Khahfi Zuhanda; Saib Suwilo; Opim Salim Sitompul; Mardingsih Mardingsih
JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Vol 5, No 2 (2022): Issues January 2022
Publisher : Universitas Medan Area

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31289/jite.v5i2.6072

Abstract

In today's business competition, educational institutions or courses require optimizing profits. However, this is not easy because, in its implementation, there are many priority objective functions that must be fulfilled. In this case, the course institution has different class programs, namely literacy, numeracy, and math olympiad programs, with various operational costs per program type and course fees per program type. This problem requires setting priorities because of the limited number of revenues, operating costs, and profit targets. In this paper, the researcher uses Winter's Exponential Smoothing forecasting model to determine the number of students, operating costs, and profits in the following year. Then the researcher analyzes the planning with the goal programming method to minimize the deviation of the multi-objective programming. This research shows that the number of student admissions who can meet market demand for January 2021 decreased by 5.41%, in February decreased by 3.20%, in March decreased by 1.29%, April remained constant, in May increased by 1.44%, June increased by 2.16%, July increased 2.82%, August increased 2.78%, September increased 3.47%, October increased 3.22%, November an increase of 3.33%, and for December an increase of 2.69%. The total operational cost that does not exceed the target limit is Rp. 30,475,0000 for one year. The total profit has reached the target to be achieved, which is Rp. 322,150,000 for one year.
Improved Benders decomposition approach to complete robust optimization in box-interval Hendra Cipta; Saib Suwilo; Sutarman Sutarman; Herman Mawengkang
Bulletin of Electrical Engineering and Informatics Vol 11, No 5: October 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v11i5.4394

Abstract

Robust optimization is based on the assumption that uncertain data has a convex set as well as a finite set termed uncertainty. The discussion starts with determining the robust counterpart, which is accomplished by assuming the indeterminate data set is in the form of boxes, intervals, box-intervals, ellipses, or polyhedra. In this study, the robust counterpart is characterized by a box-interval uncertainty set. Robust counterpart formulation is also associated with master and subproblems. Robust Benders decomposition is applied to address problems with convex goals and quasiconvex constraints in robust optimization. For all data parameters, this method is used to determine the best resilient solution in the feasible region. A manual example of this problem's calculation is provided, and the process is continued using production and operations management–quantitative methods (POM-QM) software.
Exponent and Scrambling Index of Some Composite Graphs Linna Syahputri; Saib Suwilo; Mardiningsih Mardiningsih
ZERO: Jurnal Sains, Matematika dan Terapan Vol 10, No 1 (2026): Zero: Jurnal Sains Matematika dan Terapan
Publisher : UIN Sumatera Utara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30829/zero.v10i1.28727

Abstract

A connected graphs G is primitive provided there is a positive integer k such that for each pair of vertices u and v in G there exists a uv-walk of length k. The scrambling index of a primitive graph G, , is the smallest positive integer k such that for each two vertices u and v there is a vertex w with the property that there exist a uw-walk and a vw-walk of length k. We discuss the scrambling index of the joint and the corona product of two vertex disjoint graphs. For such graphs, we discuss their primtivity and then we present their scrambling index.
Application of Internet of Things (IoT) Technology Automatic Plant Watering Using Arduino Program on Corn Plants of Sadar Tani Farmers Group Mimmy Sari Syah Putri; Saib Suwilo; Aghni Syahmarani; Putri Cahaya Situmorang; Alberto Tondang
ABDIMAS TALENTA: Jurnal Pengabdian Kepada Masyarakat Vol. 10 No. 2 (2025): ABDIMAS TALENTA: Jurnal Pengabdian Kepada Masyarakat
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/abdimastalenta.v10i2.18053

Abstract

The technology of the Internet of Things (IoT) is advancing and being implemented in a variety of sectors, including agriculture. The Sadar Tani farmer group's automatic plant watering system for maize plants is the focus of this research, which investigates the application of IoT technology. The primary controller of this system is an Arduino device, which is connected to a communication module and soil moisture sensor to transmit data in real-time. The water pump is automatically activated to irrigate the plants until the humidity level returns to normal when the soil moisture level falls below the specified limit. This implementation has yielded enhanced corn plant health, reduced farmer workload, and increased water use efficiency. Furthermore, this system enables the remote surveillance of crop conditions, which offers supplementary advantages in the management of larger agricultural lands. As a result, the implementation of IoT technology offers a viable solution to the issue of watering plants on expansive agricultural land, in addition to promoting precision agriculture that is more environmentally favorable and sustainable. This research has the potential to serve as a reference for future development in the application of similar technology to other crops and the enhancement of features to optimize agricultural yields.
Analysis of Rainfall Transition Probability Using Markov Chain Method Suhendri Pasaribu; Saib Suwilo; Herman Mawengkang
Journal of Research in Mathematics Trends and Technology Vol. 7 No. 2 (2025): Journal of Research in Mathematics Trends and Technology (JoRMTT)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32734/jormtt.v7i2.21719

Abstract

This research applies the Markov Chain model to examine daily rainfall data in Medan City. Markov chain is one of the methods used for forecasting in various fields, such as economics, industry, and climate. This research uses secondary data of daily rainfall intensity from the BMKG Station of the Center for Meteorology, Climatology and Geophysics Region I. The purpose of this research is to determine the transition probability (probability of transition). This study aims to determine the chance of transition (displacement) of daily rainfall intensity, There are four conditions of rainfall intensity that are categorized, namely no rain, light rain, moderate rain, and heavy rain. The Markov Chain method used is the Champman- Kolmogorov Equation and the steady state equation. The fixed probability of not raining is 59.16%, the fixed probability of light rain is 17.67%, the fixed probability of moderate rain is 16.28%, and the fixed probability of heavy rain is 6.86%.