A new method for solving linear programming problems using Z-numbers’ ranking

In this paper, the concept of the full Z-linear programming problem (FZLP) is first introduced. It is worth to mention that in these type of problems, all parameters, including the coefficients of variables in the objective functions, the coefficients of the variables in the constraints, the right-hand side of the constraints, as well as the decision variables, are valued as Z-numbers. Clearly, it is critical to provide a method to solve these types of problems, and to find their optimal solutions. Therefore, this paper develops a novel and practical method to find the solution of the problem using the concept of Z-numbers. To prove the applicability of the concept, two illustrative examples are provided to demonstrate the precision and effectiveness of this method.