Abstract
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.
Keywords
Linear programming
Set (abstract data type)
Mathematical optimization
Computer science
Game theory
Mathematical economics
Mathematics
Programming language
Subject Areas
Optimization and Mathematical Programming
·Control and Systems Engineering ·Physical Sciences
OpenAlex SDG Match
SDGs auto-classified by OpenAlex (score ≥ 0.4 shown).
Peace, Justice and strong institutions 54%