To read this content please select one of the options below:

A LINEAR PROGRAMMING MODEL FOR SOLVING COMPLEX 2‐PERSON ZERO‐SUM GAMES

MIKE C. PATTERSON (Professor in the Division of Business Midwestern State University, Wichita Falls, Texas. He received his doctorate in industrial management from North Texas State University and has worked as a management consultant, specializing in manufacturing systems.)

Studies in Economics and Finance

ISSN: 1086-7376

Article publication date: 1 February 1990

142

Abstract

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.

Citation

PATTERSON, M.C. (1990), "A LINEAR PROGRAMMING MODEL FOR SOLVING COMPLEX 2‐PERSON ZERO‐SUM GAMES", Studies in Economics and Finance, Vol. 13 No. 2, pp. 20-31. https://doi.org/10.1108/eb028692

Publisher

:

MCB UP Ltd

Copyright © 1990, MCB UP Limited

Related articles