求解矩阵对策的直接线性规划法  

Direct Linear Programming Algorithm for Solving Matrix Games

作　　者：白国仲[1] 朱小琨[2] 

机构地区：[1]广东商学院数学系,广东广州510320 [2]华中师范大学学报编辑部,湖北武汉430079

出　　处：《武汉大学学报（理学版）》2010年第5期597-600,共4页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金资助项目(70871050)

摘　　要：证明了一个矩阵对策问题的解等价于一个线性规划问题的最优解.提出了求解矩阵对策的一种新方法,即直接线性规划法.该方法根据所给问题建立一个特殊的线性规划模型,然后求解,可直接得到矩阵对策的值和两个局中人的最优策略,不需作变量变换,也不要求对策值大于零.给出了直接线性规划法在求解对称对策问题中的应用.By introducing a corresponding linear programming problem this paper establishes the equivalence between the optimal solutions of the linear programming and the solutions of the matrix games.In this paper,a new method for solving the matrix games is given,that is the direct linear programming algorithm.According to the direct linear programming algorithm,we must establish a special linear programming model based on the given matrix game,and solve the linear programming problem,then without making any transform we can directly obtain the value of the matrix game and each player＇s optimal strategies no matter whether the value of the game is larger than zero or not.Also,an application of the direct linear programming algorithm in a symmetric game problem is presented.

关 键 词：矩阵对策 直接线性规划法 解 

分 类 号：O225[理学—运筹学与控制论]