scholarly journals Solving of the linear optimization problem on polyarrangements with the constant sum of coordinates in the arrangements

Author(s):  
Oleg Iemets ◽  
◽  
Oleksandra Yemets ◽  
Ivan Polyakov ◽  
◽  
...  
Author(s):  
Kaisheng Liu ◽  
Yumei Xing

This article puts forward the bi-matrix games with crisp parametric payoffs based on interval value function approach. We conclude that the equilibrium solution of the game model can converted into optimal solutions of the pair of the non-linear optimization problem. Finally, experiment results show the efficiency of the model.


Sign in / Sign up

Export Citation Format

Share Document