Solving fully linear programming problem based on Z-numbers
نویسندگان
1 Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
2 Faculty of engineering and natural science, Istinye university, Istanbul, Turkey.
3 I.A.U., Science and Research Branch
4 Department of Mathematics, Islamic Azad University, Iran
5 Imam Khomeini Int. University
6 Faculty of engineering and natural sciences, Istinye University, Istanbul, Turkey
7 College of Engineering and Technology, American University of the Middle East, Kuwait
doi
10.22111/ijfs.2023.7669چکیده
Generally exploring the exact solution of linear programming problems in which all variables and parameters are Z-numbers, is either not possible or difficult. Therefore, a few numerical methods to find the numerical solutions do act an important role in these problems. In this paper, we concentrate on introducing a new numerical method to solve such problems based on the ranking function. After proving the necessary theories, for more illustrations and the correctness of the topic, some theoretical and practical examples are also provided. Finally, the results obtained from the proposed method have been compared with some existing methods.
