BibTex Citation Data :
@article{JM13899, author = {Muhammad husein}, title = {METODE PENEGASAN BILANGAN TRAPEZOIDAL FUZZY PADA PROGRAM LINIER FUZZY TIDAK PENUH}, journal = {Jurnal Matematika}, volume = {4}, number = {4}, year = {2015}, keywords = {}, abstract = { ABSTRACT. Fuzzy linear programming is one of linier programming form which there is fuzzy number form on objective variable, objective variable coefficient, constraint coefficient or right hand constraint. Fuzzy linear programming solved by parameters changing which is in fuzzy number form into crisp number form. Crisp method used to averment the trapezoidal fuzzy number and each method is not always has same result. Fuzzy linear programming problem with objective function coefficient, constraint coefficient, or right hand as a fuzzy number is the form of not fully fuzzy linear programming. This paper will discuss three crisp method, they are Ranking Function, Yager Ranking Function, and Robust Ranking Function to solve fuzzy linear programming problem. The final solution can use simplex method, and then final result compared to determine crisp method which is optimal. }, url = {https://ejournal3.undip.ac.id/index.php/matematika/article/view/13899} }
Refworks Citation Data :
ABSTRACT. Fuzzy linear programming is one of linier programming form which there is fuzzy number form on objective variable, objective variable coefficient, constraint coefficient or right hand constraint. Fuzzy linear programming solved by parameters changing which is in fuzzy number form into crisp number form. Crisp method used to averment the trapezoidal fuzzy number and each method is not always has same result. Fuzzy linear programming problem with objective function coefficient, constraint coefficient, or right hand as a fuzzy number is the form of not fully fuzzy linear programming. This paper will discuss three crisp method, they are Ranking Function, Yager Ranking Function, and Robust Ranking Function to solve fuzzy linear programming problem. The final solution can use simplex method, and then final result compared to determine crisp method which is optimal.
Last update:
