Two-person Zero-sum Game Problem Solution: Integer Simplex Method


Abstract views: 9 / PDF downloads: 6

Authors

  • M. V. Subba Rao Department of Mathematics, ANITS, Visakhapatnam, India
  • M. N. R. Chowdary Department of Physical Education, GITAM University, Hyderabad, India
  • J. Vijayasekhar Department of Mathematics, GITAM University, Hyderabad, India

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

15-12-2017

How to Cite

M. V. Subba Rao, M. N. R. Chowdary, & J. Vijayasekhar. (2017). Two-person Zero-sum Game Problem Solution: Integer Simplex Method. International Journal of Mathematics And Its Applications, 5(4 - E), 633–635. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1319

Issue

Vol. 5 No. 4 - E (2017)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.