| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4630970 | Applied Mathematics and Computation | 2011 | 7 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Wei Li, Haohao Li,