EXTENSIONS OF THE POTENTIAL REDUCTION ALGORITHM FOR LINEAR-PROGRAMMING

被引:2
|
作者
YE, YY
机构
[1] Department of Management Sciences, College of Business Administration, University of Iowa, Iowa City, Iowa
关键词
LINEAR PROGRAMMING; PRIMAL AND DUAL PROBLEMS; BIMATRIX GAMES; POTENTIAL FUNCTION; POTENTIAL REDUCTION ALGORITHM;
D O I
10.1007/BF00939838
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this work, we study several extensions of the potential reduction algorithm that was developed for linear programming. These extensions include choosing different potential functions, generating the analytic center of a polytope, and finding the equilibrium of a zero-sum bimatrix game.
引用
收藏
页码:487 / 498
页数:12
相关论文
共 50 条