Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
Journal Title: Bulletin of Computational Applied Mathematics (Bull CompAMa) - Year 2017, Vol 5, Issue 1
Abstract
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were used. The cut-set based method for matrix games with payoffs of TrIFNs was also considered. Compute the interval-type value of any alfa-constrategies by simplex method for linear programming. The proposed method is illustrated with a numerical example.
Authors and Affiliations
Darunee Hunwisai, Poom Kumam
Keywords
Related Articles
- EP ID EP243954
- DOI -
- Views 115
- Downloads 0
A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
This work addresses a spectral correction for the Gauss-Newton model in the solution of nonlinear least-squares problems within a globally convergent algorithmic framework. The nonmonotone line search of Zhang and Hager...
Linear programming model for solution of matrix game with payoffs trapezoidal intuitionistic fuzzy number
In this work, we considered two-person zero-sum games with fuzzy payoffs and matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). The concepts of TrIFNs and their arithmetic operations were use...
Global improvements of a protein alignment algorithm and comparison with a global optimization solver
The LovoAlign method for Protein Alignment, based on the Low-Order Value Optimization theory, is recalled. The method is modified in order to improve global convergence properties and compared against other global minimi...
Modified Spectral Projected Subgradient Method: Convergence Analysis and Momentum Parameter Heuristics
The Modified Spectral Projected Subgradient (MSPS) was proposed to solve Langrangen Dual Problems, and its convergence was shown when the momentum term was zero. The MSPS uses a momentum term in order to speed up its con...
Loop topological complexity
We introduce here the notion of loop motion planning algorithms and show that it yields to a homotopical invariant: the loop topological complexity, denoted throughout this paper by $\rm{TC}^{\rm{LP}}(-)$, which measures...