Selviana Anggreani
Unknown Affiliation

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

Found 2 Documents
Search

Studi Literatur Tentang Efektivitas Metode Dua Fase dalam Menyelesaikan Masalah Program Linear Syofiah Sinaga; Selviana Anggreani; Vina Al Liana; Siti Salamah Br Ginting
Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa Vol. 3 No. 4 (2025): Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/algoritma.v3i4.608

Abstract

This study uses a qualitative method with a literature review approach to examine the effectiveness of the two-phase method in solving linear programming problems. The two-phase method is one of the techniques in linear programming used when the objective function does not have a feasible initial solution directly. Through the exploration and analysis of various scientific literature sources from 2019 onwards, this study finds that the two-phase method can systematically provide optimal solutions, especially in complex problems with multiple constraints. Previous research has shown that this method is effective in accelerating the identification of basic feasible solutions and minimizing unnecessary iterations compared to the standard simplex method. Additionally, the two-phase method offers better numerical stability and high reliability in both industrial and educational applications. However, its effectiveness largely depends on the understanding of the algorithm and the ability to design an appropriate mathematical model. The results of this study are expected to contribute theoretically to the development of efficient solution techniques for linear optimization problems.
Pengantar dan Pengenalan Konsep Dasar Algoritma Pemrograman Selviana Anggreani; Yahfizham Yahfizham
Pendekar : Jurnal Pendidikan Berkarakter Vol. 2 No. 1 (2024): Februari : Jurnal Pendidikan Berkarakter
Publisher : LPPM Politeknik Pratama

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51903/pendekar.v2i1.599

Abstract

An introduction to algorithms starts from the basic concepts of algorithms. An algorithm is a series of organized steps to solve a problem, taking into account systematic sequence and logical goals. Meanwhile, a programming algorithm is a combination of instructions that a computer must carry out when solving a problem. Mastering good programming algorithms is absolutely necessary for those who want to master computer science or mathematics. For this reason, this article aims to help understand algorithms through basic concepts through literature methods from various existing sources so that we can also discuss their history, characteristics and properties, algorithm structure, notation including naturalness, pseudocode, and flowcharts.