Linear Programming Models and Methods of Matrix Games with Payoffs of Triangular Fuzzy Numbers

Author(s):  
Deng-Feng Li
Author(s):  
DENG-FENG LI

The purpose of the paper is to study how to solve a type of matrix games with payoffs of triangular fuzzy numbers. In this paper, the value of a matrix game with payoffs of triangular fuzzy numbers has been considered as a variable of the triangular fuzzy number. First, based on two auxiliary linear programming models of a classical matrix game and the operations of triangular fuzzy numbers, fuzzy optimization problems are established for two players. Then, based on the order relation of triangular fuzzy numbers the fuzzy optimization problems for players are decomposed into three-objective linear programming models. Finally, using the lexicographic method maximin and minimax strategies for players and the fuzzy value of the matrix game with payoffs of triangular fuzzy numbers can be obtained through solving two corresponding auxiliary linear programming problems, which are easily computed using the existing Simplex method for the linear programming problem. It has been shown that the models proposed in this paper extend the classical matrix game models. A numerical example is provided to illustrate the methodology.


2016 ◽  
Vol 33 (06) ◽  
pp. 1650047 ◽  
Author(s):  
Sanjiv Kumar ◽  
Ritika Chopra ◽  
Ratnesh R. Saxena

The aim of this paper is to develop an effective method for solving matrix game with payoffs of trapezoidal fuzzy numbers (TrFNs). The method always assures that players’ gain-floor and loss-ceiling have a common TrFN-type fuzzy value and hereby any matrix game with payoffs of TrFNs has a TrFN-type fuzzy value. The matrix game is first converted to a fuzzy linear programming problem, which is converted to three different optimization problems, which are then solved to get the optimum value of the game. The proposed method has an edge over other method as this focuses only on matrix games with payoff element as symmetric trapezoidal fuzzy number, which might not always be the case. A numerical example is given to illustrate the method.


2019 ◽  
Vol 17 (1) ◽  
pp. 607-626 ◽  
Author(s):  
Chunquan Li

Abstract A multi-objective linear programming problem (ITF-MOLP) is presented in this paper, in which coefficients of both the objective functions and constraints are interval-typed triangular fuzzy numbers. An algorithm of the ITF-MOLP is provided by introducing the cut set of interval-typed triangular fuzzy numbers and the dominance possibility criterion. In particular, for a given level, the ITF-MOLP is converted to the maximization of the sum of membership degrees of each objective in ITF-MOLP, whose membership degrees are established based on the deviation from optimal solutions of individual objectives, and the constraints are transformed to normal inequalities by utilizing the dominance possibility criterion when compared with two interval-typed triangular fuzzy numbers. Then the equivalent linear programming model is obtained which could be solved by Matlab toolbox. Finally several examples are provided to illuminate the proposed method by comparing with the existing methods and sensitive analysis demonstrates the stability of the optimal solution.


Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2937
Author(s):  
Saeid Jafarzadeh Ghoushchi ◽  
Elnaz Osgooei ◽  
Gholamreza Haseli ◽  
Hana Tomaskova

Recently, new methods have been recommended to solve fully fuzzy linear programming (FFLP) issues. Likewise, the present study examines a new approach to solve FFLP issues through fuzzy decision parameters and variables using triangular fuzzy numbers. The strategy, which is based on alpha-cut theory and modified triangular fuzzy numbers, is suggested to obtain the optimal fully fuzzy solution for real-world problems. In this method, the problem is considered as a fully fuzzy problem and then is solved by applying the new definition presented for the triangular fuzzy number to optimize decision variables and the objective function. Several numerical examples are solved to illustrate the above method.


Sign in / Sign up

Export Citation Format

Share Document