Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Jurnal Elektronika dan Teknik Informatika Terapan Katalis Pendidikan: Jurnal Ilmu Pendidikan dan Matematika
Nursania Simbolon
Unknown Affiliation
Computer Science & IT Education Mathematics Other

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Studi Literartur Algoritma Pemograman Pada Pembelajaran Matematika Nursania Simbolon; Yahfizham Yahfizham
Jurnal Elektronika dan Teknik Informatika Terapan ( JENTIK ) Vol. 1 No. 4 (2023): Desember: Jurnal Elektronika dan Teknik Informatika Terapan (JENTIK)
Publisher : Politeknik Kampar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59061/jentik.v1i4.510

Abstract

An algorithm is an effective step or method used to solve a particular problem or task. Algorithms are designed to be executed in a methodical manner, structured As it is. logical in this way, thus enabling consistent and efficient problem solving. A few issues that could come up during the process of designing an algorithm include: 1. Inappropriate Structure, .2. Illogical Algorithm, .3. Difficulty in Solving Algorithms: Sometimes, solving algorithms can be difficult, especially if the problem at hand is complex. This can cause confusion and require extra time to design the right algorithm. Programming algorithms typically serve as a guide for computer programmers in designing and implementing software solutions. This algorithm must be clear, systematic, and can be implemented well in the chosen programming language. This research shows that It is crucial to deal with this matter in order to plan and design the algorithm carefully. This may involve modeling the problem, logical thinking, and testing the algorithm to ensure that the algorithm is working as intended. Additionally, in software development, teams often work together to solve problems and optimize algorithms. With good practice and experience, solving algorithms can become more efficient and effective. The following are several types of programming algorithms related to mathematics: 1. Basic Mathematical Operation Algorithms, 2. Search and Sorting Algorithms, 3. Graph Algorithms 4. Geometry Algorithms, 5. Cryptographic Algorithms, 6. Statistical Algorithms, 7. Machine Learning Algorithms, 8. Advanced Mathematical Algorithms. This study uses a library approach and is qualitative.
Systematic Literature Review: Implementasi Metode Big M dalam Mengoptimalkan berbagai Kasus Program Linier Azra Sabrina; Nursania Simbolon; Armina Rangkuti; Siti Salamah Br Ginting
Katalis Pendidikan : Jurnal Ilmu Pendidikan dan Matematika Vol. 2 No. 3 (2025): Katalis Pendidikan : Jurnal Ilmu Pendidikan dan Matematika
Publisher : Lembaga Pengembangan Kinerja Dosen

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/katalis.v2i3.2018

Abstract

Linear programming is a crucial operations research method for optimization problems in various fields like manufacturing and logistics, but it is often hindered by the absence of a basic feasible solution due to artificial variables. The Big M method addresses this by adding artificial variables and a large penalty, allowing the discovery of a valid initial solution without altering the constraint structure. This research employs a Systematic Literature Review (SLR) to examine the implementation of the Big M method in Indonesia from 2015-2025, analyzing journals and proceedings related to linear programming optimization. The review findings indicate that this method is highly effective and flexible for diverse cases such as production, animal feed, and scheduling, capable of handling artificial constraints and optimizing profit or cost. Although efficient, the Big M method has drawbacks, including computational complexity and dependence on the precise selection of the M value, which can affect result accuracy. Overall, the Big M Method remains relevant and important for real-world optimization problems requiring systematic constraint handling.
Co-Authors Armina Rangkuti Azra Sabrina Siti Salamah Br Ginting yahfizham yahfizham