Abstract
The existing models of conflict resolution in game theory use the relevant information about the expected value of the strategy to find the solution. These models do not pay adequate attention to the possibility of choices and the probability of performance by the opponent.
In this paper we introduce a linear programming model to solve a multi-objective zero-sum game without the exchange of information. In our model the decision maker is asked to choose one strategy from a list of seven. This information which is relative to any of strategies (against opponent choices) is probable and the strategy performance possible.
)