On MOA Rule and Direct Methods for Linear Programming

摘要：

The most-obtuse-angle rule (MOA rule), an effective pivot rule, has resulted in some very encour- aging results on pivot algorithms for linear program- ming. By exploiting the characteristic of the MOA rule and convex polytope, we propose a direct method for linear programming with two variables and many con- straints. The method used in this paper will provide some guidance to look for designing direct algorithm for general linear programming problems. Moreover, we give some examples to show that the caution should be taken when apply the MOA rule.

作者: Wei Li

作者单位: Wei Li Institute of Operational Research & Cybernetics Hangzhou Dianzi University Hangzhou, 310018

会议类型: 国际会议

会议名称: Fourth International Conference on Impulsive and Hybrid Dynamical Systems(ICIHDS 2007)(第四届国际脉冲和混合动力系统学术会议)

会议地点: 南宁

会议语种:英文

在线出版日期: 2007-07-20（万方平台首次上网日期，不代表论文的发表时间）