Previous |  Up |  Next

Article

Title: On sparsity of approximate solutions to max-plus linear systems (English)
Author: Li, Pingke
Language: English
Journal: Kybernetika
ISSN: 0023-5954 (print)
ISSN: 1805-949X (online)
Volume: 60
Issue: 3
Year: 2024
Pages: 412-425
Summary lang: English
.
Category: math
.
Summary: When a system of one-sided max-plus linear equations is inconsistent, the approximate solutions within an admissible error bound may be desired instead, particularly with some sparsity property. It is demonstrated in this paper that obtaining the sparsest approximate solution within a given $L_{\infty}$ error bound may be transformed in polynomial time into the set covering problem, which is known to be NP-hard. Besides, the problem of obtaining the sparsest approximate solution within a given $L_1$ error bound may be reformulated as a polynomial-sized mixed integer linear programming problem, which may be regarded as a special scenario of the facility location-allocation problem. By this reformulation approach, this paper reveals some interesting connections between the sparsest approximate solution problems in max-plus algebra and some well known problems in discrete and combinatorial optimization. (English)
Keyword: max-plus algebra
Keyword: max-plus linear systems
Keyword: sparsity
Keyword: set covering
Keyword: mixed integer linear programming
MSC: 15A80
MSC: 90C11
MSC: 90C24
DOI: 10.14736/kyb-2024-3-0412
.
Date available: 2024-07-29T12:41:53Z
Last updated: 2024-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/152518
.
Reference: [1] Baccelli, F., Cohen, G., Olsder, G. J., Quadrat, J. P.: Synchronization and Linearity: An Algebra for Discrete Event Systems..Wiley, Chichester 1992. MR 1204266
Reference: [2] Butkovič, P.: Max-linear Systems: Theory and Algorithms..Springer, Berlin 2010. Zbl 1202.15032, MR 2681232
Reference: [3] Cuninghame-Green, R. A.: Minimax Algebra, Lecture Notes in Economics and Mathematical Systems, Vol. 166..Springer, Berlin 1979. MR 0580321
Reference: [4] Gondran, M., Minoux, M.: Graphs, Dioids and Semirings: New Models and Algorithms..Springer, New York 2008. Zbl 1201.16038, MR 2389137
Reference: [5] Gotoh, J., Uryasev, S.: Two pairs of families of polyhedral norms versus $\ell_p$-norms: proximity and applications in optimization..Math. Program. 156 (2016), 391-431. MR 3459206,
Reference: [6] Heidergott, B., Olsder, G. J., Woude, J. van der: Max Plus at Work: Modeling and Analysis of Synchronized Systems..Princeton University Press, Princeton 2005. MR 2188299
Reference: [7] Joswig, M.: Essentials of Tropical Combinatorics..American Mathematical Society, 2021. MR 4423372
Reference: [8] Krivulin, N.: Methods of Idempotent Algebra for Problems in Modeling and Analysis of Complex Systems..Saint Petersburg University Press, St. Petersburg 2009. (in Russian)
Reference: [9] Krivulin, N.: Solution of linear equations and inequalities in idempotent vector spaces..Int. J. Appl. Math. Inform. 7 (2013), 14-23.
Reference: [10] Li, P.: A note on resolving the inconsistency of one-sided max-plus linear equations..Kybernetika 55 (2019), 531-539. MR 4015997,
Reference: [11] Li, P.: Solving the sensor cover energy problem via integer linear programming..Kybernetika 57 (2021), 568-593.
Reference: [12] Li, P.: Linear optimization over the approximate solutions of a system of max-min equations..Fuzzy Sets Systems 484 (2024), 108946. MR 4721551,
Reference: [13] Li, P., Fang, S. C.: On the resolution and optimization of a system of fuzzy relational equations with sup-$T$ composition..Fuzzy Optim. Decision Making 7 (2008), 169-214. Zbl 1169.90493, MR 2403173,
Reference: [14] Tsiamis, A., Maragos, P.: Sparsity in max-plus algebra and systems..Discrete Event Dynamic Systems 29 (2019), 163-189. MR 3969320,
Reference: [15] Tsilivis, N., Tsiamis, A., Maragos, P.: Toward a sparsity theory on weighted lattices..J. Math. Imaging Vision 64 (2022), 705-717. MR 4476213,
.

Files

Files Size Format View
Kybernetika_60-2024-3_7.pdf 418.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo