کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4630970 1340613 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On simplex method with most-obtuse-angle rule and cosine rule
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
On simplex method with most-obtuse-angle rule and cosine rule
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 217, Issue 20, 15 June 2011, Pages 7867–7873
نویسندگان
, ,