Two-person Zero-sum Game Problem Solution: Integer Simplex Method
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Linear programming problem (LPP), Game problem, optimal strategies, Integer simplex method (Gomory's cutting plane method)Abstract
In this paper, we have calculated the optimal strategies of two-person zero-sum game problems which does not have a saddle point using Integer simplex method (Gomory's cutting plane method).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.