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
Sparse approximations of matrix functions via numerical integration of ODEs
We consider the numerical computation of matrix functions f(x) via matrix ODE integration. The solution is modeled as an asymptotic steady state of a proper differential system. The framework we propose, allows to define...
Total dominator chromatic number of some operations on a graph
Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominat...
GNU Oflox: an academic software for the minimal cost network flow problem
We present an open-source software package written for GNU Octave. The software is an implementation of the Simplex algorithm for the minimal cost network flow problem oriented towards the academic environment. The imple...
Evaluation of the Von Rosenberg's method for the convection-diffusion equation
An explicit numerical scheme developed by Von Rosenberg for the convection-diffusion equation in one spatial dimension is reviewed and analyzed. The convergence of this scheme is outlined and a comparative study was esta...
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...