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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chubanov, S.: A polynomial relaxation-type algorithm for linear programming. Optimization Online, February 2011
Chubanov, S.: A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134(2), 533–570 (2012)
Cormen, Th.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge, MA (2009)
Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)
Khachiyan, L.: Polynomial algorithm for linear programming. Soviet Math. Doklady 224(5), 1093–1096 (1979)
Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, Cham, Switzerland (2016)
Papadimitriou, C.H.: Computational Complexity. Pearson, Boston, MA (1993)
Acknowledgements
This work was supported by Chiang Mai University. It was also partially supported by the US National Science Foundation via grant HRD-1242122.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kosheleva, O., Kreinovich, V., Dumrongpokaphan, T. (2020). A Symmetry-Based Explanation of the Main Idea Behind Chubanov’s Linear Programming Algorithm. In: Nguyen, H., Kreinovich, V. (eds) Algebraic Techniques and Their Use in Describing and Processing Uncertainty. Studies in Computational Intelligence, vol 878. Springer, Cham. https://doi.org/10.1007/978-3-030-38565-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-38565-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38564-4
Online ISBN: 978-3-030-38565-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)