TAILIEUCHUNG - Max-min solution approach for multiobjective matrix game with fuzzy goals

In this paper, we consider a multi-objective two person zero-sum matrix game with fuzzy goals, assuming that each player has a fuzzy goal for each of the payoffs. The max-min solution is formulated for this multi-objective game model, in which the optimization problem for each player is a linear programming problem. Every developed model for each player is demonstrated through a numerical example. | Yugoslav Journal of Operations Research 26 (2016), Number 1, 51-60 DOI: MAX-MIN SOLUTION APPROACH FOR MULTIOBJECTIVE MATRIX GAME WITH FUZZY GOALS Sandeep KUMAR Department of Mathematics , Meerut-250004 India drsandeepmath@ Received: April 2014 / Accepted: January 2015 Abstract: In this paper, we consider a multi-objective two person zero-sum matrix game with fuzzy goals, assuming that each player has a fuzzy goal for each of the payoffs. The max-min solution is formulated for this multi-objective game model, in which the optimization problem for each player is a linear programming problem. Every developed model for each player is demonstrated through a numerical example. Keywords: Multi-objective matrix game, Fuzzy goal, Max-min solution. MSC: 90C29, 91A05. 1. INTRODUCTION Game theory is concerned with decision making problem where two or more autonomous decision makers have conflicting interests. They are usually referred to as players who act strategically to find out a compromise solution. On the other hand, in multi-objective optimization problems, a single decision maker optimizes the solution among the conflicting objectives. Multi-objective matrix games are capable of dealing with both types of conflicts. When interest of one player is completely against the interest of others, matrix game is determined as two person zero-sum matrix game. Fuzziness in game problems may occur in goals and payoffs. Such types of game were first studied by Campos [8]. His approach was based on ranking of fuzzy numbers. Afterwards, Sakawa and Nishizaki [17] studied single and multi-objective matrix games with fuzzy goals and fuzzy payoffs by using max-min principle of game theory. Bector et al. [5, 6], and Vijay et al. [18] proved that a two person zero-sum matrix game with fuzzy goals and fuzzy payoffs is equivalent to a pair of linear programming problems, which are dual to each other in fuzzy sense. Their methodology was .

• Kỹ thuật lập trình
• Multi objective matrix game
• Fuzzy goal
• Max min solution
• Optimization problem
• Linear programming problem
• Ebook Linear optimization
• Linear optimization
• Linear extensions
• The linear programming problem
• Simplex algorithms
• Primal dual pairs
• Lecture Algorithms
• Bài giảng Thuật toán
• Linear Programming
• Brewer’s problem
• Linear programming formulation
• Objective function
• Project scheduling with cost minimization
• Construction management
• Project schedule optimization
• Time cost analysis
• Mixed integer linear programming
• Travelling salesman problem
• Modelling code
• MIP executing quickly
• Hamiltonian cycle
• The electric vehicle routing problem with backhauls
• The electric vehicle routing problem
• Electric vehicle routing problem
• The linehaul route
• Permutations with low discrepancy
• Consecutive k sums
• Basic definition
• Permutation problem
• Multilevel programming
• Indefinite quadratic programming
• Fractional programming
• Quasi concave function
• Integer programming
• Simplex type algorithms
• Primal dual exterior point algorithm
• Computational study
• Fuzzy Goal Programming
• α Cut Analysis
• Supply Chain Master Planning
• Possibilistic Linear Programming
• Fuzzy multi objective linear model
• Lecture Methods of Electric Power Systems
• Bài giảng Phương pháp phân tích hệ thống điện
• Methods of electric power systems
• Optimal power flow
• Linear programming (LP)
• OPF problem formulation
• The traveling salesman problem with multi visit drone
• Multi visit drone
• Traveling salesman problem; Multi visit drone
• Iterated local search
• Random interval parameters
• Goal programming model
• Satisfactory solution
• Random interval programming
• Mean value
• Three stage series structure
• Non linear programming problem
• Two stage nonlinear programming problem
• Network data envelopment analysis model
• Two stage method
• Time minimizing transportation problem(TMTP)
• Non linear programming(NLP)
• Lexicographic solution
• Primary transportation
• Lexicographic optimization
• Linear programming technique
• Total crashing cost
• Mathematical model of the problem
• Time crashing problem
• Optimal crashing time scheduling
• Multiobjective programming
• Sum of ratio
• Multiobjective linear fractional programming
• Optimality and duality
• Saddle point criteria
• Genetic Algorithm
• Optimal Recombination Problem
• Boolean Linear Programming
• Optimal recombination