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.

[1]  Ping-Qi Pan The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study , 1997 .

[2]  Pablo Guerrero-García,et al.  Phase I cycling under the most-obtuse-angle pivot rule , 2005, Eur. J. Oper. Res..

[3]  Wei-Chang Yeh,et al.  A simple direct cosine simplex algorithm , 2009, Appl. Math. Comput..

[4]  Jian-Feng Hu,et al.  A note on "an improved initial basis for the simplex algorithm" , 2007, Comput. Oper. Res..

[5]  Predrag S. Stanimirovic,et al.  Two Direct Methods in Linear Programming , 2001, Eur. J. Oper. Res..

[6]  Uwe H. Suhl,et al.  Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms , 2007, Comput. Optim. Appl..

[7]  Tibor Illés,et al.  Pivot versus interior point methods: Pros and cons , 2002, Eur. J. Oper. Res..

[8]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[9]  Ping-Qi Pan,et al.  A Variant of the Dual Pivoting Rule in Linear Programming , 1994 .

[10]  Wei Li A note on two direct methods in linear programming , 2004, Eur. J. Oper. Res..

[11]  Jinhui Xu,et al.  Two-variable linear programming in parallel , 1998, Comput. Geom..

[12]  Wei Li,et al.  A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule , 2006, Comput. Math. Appl..

[13]  Marcos Pereira Estellita Lins,et al.  An improved initial basis for the Simplex algorithm , 2005, Comput. Oper. Res..

[14]  Ángel Santos-Palomo,et al.  The sagitta method for solving linear programs , 2004, Eur. J. Oper. Res..

[15]  Jay M. Rosenberger,et al.  The cosine simplex algorithm , 2006 .

[16]  Pingqi Pan,et al.  Practical finite pivoting rules for the simplex method , 1990 .

[17]  Marcos Pereira Estellita Lins,et al.  An improved intial basis for the simplex algorithm , 2005 .

[18]  Angel Santos-Palomo,et al.  Continuous Optimization Phase I cycling under the most-obtuse-angle pivot rule q , 2005 .