A Comparison Among Simple Algorithms for Linear Programming

• Autor(a) principal: SILVA,J.
• Data de Publicação: 2018
• Outros Autores: GHIDINI,C.T.L.S., OLIVEIRA,A.R.L., FONTOVA,M.I.V.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online)
• Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512018000200305
• topic: Linear programming; von Neumann’s algorithm; Simple algorithms

ABSTRACT This paper presents a comparison between a family of simple algorithms for linear programming and the optimal pair adjustment algorithm. The optimal pair adjustment algorithm improvements the convergence of von Neumann’s algorithm which is very attractive because of its simplicity. However, it is not practical to solve linear programming problems to optimality, since its convergence is slow. The family of simple algorithms results from the generalization of the optimal pair adjustment algorithm, including a parameter on the number of chosen columns instead of just a pair of them. Such generalization preserves the simple algorithms nice features. Significant improvements over the optimal pair adjustment algorithm were demonstrated through numerical experiments on a set of linear programming problems.