On simplex method with most-obtuse-angle rule and cosine rule |
| |
| Authors: | Wei Li Haohao Li |
| |
| Affiliation: | a Institute of Operational Research & Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, PR China
b Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, PR China |
| |
| Abstract: | A class of simplex methods for solving linear programming (LP) problems, with cosine pivot rule, have been presented in some recent papers. In this paper we show that the cosine rule used in this class is equivalent to the most-obtuse-angle pivot rule, proposed by Pan (1990) [6]. The relation between the direct method for LP and the most-obtuse-angle rule is discussed. |
| |
| Keywords: | Linear programming Most-obtuse-angle rule Cosine rule Direct method |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
