Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling

From MaRDI portal
Publication:2397043

DOI10.1016/J.JLAMP.2017.03.004zbMATH Open1386.90174arXiv1504.02602OpenAlexW3101473527MaRDI QIDQ2397043FDOQ2397043


Authors: Nikolai Krivulin Edit this on Wikidata


Publication date: 29 May 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Abstract: Optimization problems are considered in the framework of tropical algebra to minimize and maximize a nonlinear objective function defined on vectors over an idempotent semifield, and calculated using multiplicative conjugate transposition. To find the minimum of the function, we first obtain a partial solution, which explicitly represents a subset of solution vectors. We characterize all solutions by a system of simultaneous equation and inequality, and show that the solution set is closed under vector addition and scalar multiplication. A matrix sparsification technique is proposed to extend the partial solution, and then to obtain a complete solution described as a family of subsets. We offer a backtracking procedure that generates all members of the family, and derive an explicit representation for the complete solution. As another result, we deduce a complete solution of the maximization problem, given in a compact vector form by the use of sparsified matrices. The results obtained are illustrated with illuminating examples and graphical representations. We apply the results to solve real-world problems drawn from project (machine) scheduling, and give numerical examples.


Full work available at URL: https://arxiv.org/abs/1504.02602




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Algebraic solution of tropical optimization problems via matrix sparsification with application to scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397043)