A Comparison Among Simple Algorithms for Linear Programming

Authors

  • Jair Silva Federal University of Paraná
  • Carla T. L. S. Ghidini School of Applied Sciences, University of Campinas
  • Aurelio R. L. Oliveira Institute of Mathematics, Statistics and Scientific Computing, University of Campinas
  • Marta I. V. Fontova Faculty of Campo Limpo Paulista

DOI:

https://doi.org/10.5540/tema.2018.019.02.305

Keywords:

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.

Downloads

Additional Files

Published

2018-09-12

How to Cite

Silva, J., Ghidini, C. T. L. S., Oliveira, A. R. L., & Fontova, M. I. V. (2018). A Comparison Among Simple Algorithms for Linear Programming. Trends in Computational and Applied Mathematics, 19(2), 305. https://doi.org/10.5540/tema.2018.019.02.305

Issue

Vol. 19 No. 2 (2018)

Section

Original Article

License

Authors who publish in this journal agree to the following terms: 

  1. Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.

  2. Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
     

  3. Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).

  4. This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
    author. This is in accordance with the BOAI definition of open access

 

Intellectual Property

All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.