Advertisement

A Symmetry-Based Explanation of the Main Idea Behind Chubanov’s Linear Programming Algorithm

  • Olga Kosheleva
  • Vladik KreinovichEmail author
  • Thongchai Dumrongpokaphan
Chapter
  • 8 Downloads
Part of the Studies in Computational Intelligence book series (SCI, volume 878)

Abstract

Many important real-life optimization problems can be described as optimizing a linear objective function under linear constraints—i.e., as a linear programming problem. This problem is known to be not easy to solve. Reasonably natural algorithms—such as iterative constraint satisfaction or simplex method—often require exponential time. There exist efficient polynomial-time algorithms, but these algorithms are complicated and not very intuitive. Also, in contrast to many practical problems which can be computed faster by using parallel computers, linear programming has been proven to be the most difficult to parallelize. Recently, Sergei Chubanov proposed a modification of the iterative constraint satisfaction algorithm: namely, instead of using the original constraints, he proposed to come up with appropriate derivative constraints. Interestingly, this idea leads to a new polynomial-time algorithm for linear programming—and to efficient algorithms for many other constraint satisfaction problems. In this paper, we show that an algebraic approach—namely, the analysis of the corresponding symmetries—can (at least partially) explain the empirical success of Chubanov’s idea.

Keywords

Linear programming Chubanov’s algorithm Symmetry-based explanation 

Notes

Acknowledgements

This work was supported by Chiang Mai University. It was also partially supported by the US National Science Foundation via grant HRD-1242122.

References

  1. 1.
    Chubanov, S.: A polynomial relaxation-type algorithm for linear programming. Optimization Online, February 2011Google Scholar
  2. 2.
    Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134(2), 533–570 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Cormen, Th.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge, MA (2009)Google Scholar
  4. 4.
    Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Khachiyan, L.: Polynomial algorithm for linear programming. Soviet Math. Doklady 224(5), 1093–1096 (1979)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, Cham, Switzerland (2016)CrossRefGoogle Scholar
  7. 7.
    Papadimitriou, C.H.: Computational Complexity. Pearson, Boston, MA (1993)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Olga Kosheleva
    • 1
  • Vladik Kreinovich
    • 1
    Email author
  • Thongchai Dumrongpokaphan
    • 2
  1. 1.University of Texas at El PasoEl PasoUSA
  2. 2.Department of Mathematics, Faculty of ScienceChiang Mai UniversityChiang MaiThailand

Personalised recommendations