Discrimination Methods of Efficient Solutions for Multiobjective Linear Programming Problems with Interval Coefficients
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
In this article, we construct a new computational algorithm for solving multiobjective linear programming problem in intuitionistic fuzzy environment. The resources and technological coefficients are taken to be intuitionistic fuzzy numbers. Here, the intuitionistic fuzzy multi-o
In the paper we present a new iterative method for solving multiobjective linear programming problems with an arbitrary number of decision makers. The method is based on the principles of game theory. Each step of the method yields a unique solution which respects the aspirations
Multiobjective Programming (MOP) has become famous among many researchers due to more practical and realistic applications. A lot of methods have been proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is