A LINEAR PROGRAMMING MODEL FOR SOLVING COMPLEX 2‐PERSON ZERO‐SUM GAMES
Two‐person zero‐sum game theory has long been a popular topic of research in business and economics. The purpose of this paper is to discuss how to convert a two‐person zero‐sum game into a linear programming problem and to present a computer simulation model for solving large bilateral zero‐sum games problems.