Solving fully linear programming problem based on Z-numbers

Generally exploring the exact solution of linear programming problems in which all variables and parameters are Znumbers, 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.

Automated summary

This paper introduces a new numerical method based on the ranking function to solve linear programming problems with Z numbers. The necessary theories are proved and theoretical and practical examples are provided to illustrate the correctness of the method. The results obtained from the proposed method are compared with existing methods.