An interactive method by founding weights via bargaining sets to solve the multiple objective linear programming problems

In this paper, the authors consider the multiple objective linear programming (MOLP) problem which is defined as a linear type of the multiple objective mathematical programming. The bargaining set is obtained by considering the discussion that may actually take place during a play of the game. Thus the possible threats and counterthreats made by several players are considered. The solution of game corresponds to found nucleolus of the bargaining set