Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal E-Jurnal Matematika
RIZAL MUHAIMIN
Universitas Negeri Medan
Mathematics

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

Found 1 Documents
Search

 1 
ANALISIS PERBANDINGAN METODE FUZZY SIMPLEKS DAN KUMAR DALAM OPTIMASI PRODUKSI FULLY FUZZY LINEAR PROGRAMMING NERLI KHAIRANI; RIZAL MUHAIMIN; NAFASA ZAHRI; NAYSLA AURA SIFFA
E-Jurnal Matematika Vol. 15 No. 3 (2026)
Publisher : Mathematics Department, Faculty of Mathematics and Natural Sciences, Udayana University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24843/MTK.2026.v15.i03.p519

Abstract

This study discusses a comparative analysis between the fuzzy simplex method and Kumar’s method in solving production optimization problems based on Fully Fuzzy Linear Programming (FFLP). Production optimization problems in real conditions often involve uncertainty in production costs, resource availability, and market demand fluctuations. Therefore, the FFLP approach is applied because all model parameters, including objective functions, constraints, and decision variables, are represented using trapezoidal fuzzy numbers to better describe uncertainty. This research employed a quantitative comparative approach using simulation data with two decision variables. The optimization model was solved using the fuzzy simplex method and Kumar’s method with the Liou–Wang ranking function. The results showed that both methods produced identical optimal solutions, including the same optimal decision variable values, fuzzy profit values, and number of iterations required to reach optimality. However, Kumar’s method provided a simpler pivot selection process through the use of ranking functions, while the fuzzy simplex method was more effective in maintaining the integrity of fuzzy data throughout the iteration process. Based on the comparative analysis, both methods were proven effective for solving FFLP problems, although they differ in computational complexity and operational procedures.
Co-Authors NAFASA ZAHRI NAYSLA AURA SIFFA Nerli Khairani