Abstract tropical linear programming

Loho, Georg (2020) Abstract tropical linear programming. Electronic Journal of Combinatorics, 27 (2). ISSN 1077-8926

Text (Abstract tropical linear programming) - Published Version Available under License Creative Commons Attribution. Download (596kB)

• Author

Abstract

In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. We obtain an algorithm based on an axiomatic approach to this generalization. It builds on the introduction of signed tropical matroids based on the polyhedral properties of triangulations of the product of two simplices and the combinatorics of the associated set of bipartite graphs with an additional sign information. Finally, we establish an upper bound for our feasibility algorithm applied to a system of min-plus-inequalities in terms of the secondary fan of a product of two simplices. The appropriate complexity measure is a shortest integer vector in a cone of the secondary fan associated to the system.

Item Type:	Article
Official URL:	https://www.combinatorics.org/ojs/index.php/eljc
Additional Information:	© 2020 The Author
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	15 Jun 2020 16:18
Last Modified:	28 Feb 2024 04:09
URI:	http://eprints.lse.ac.uk/id/eprint/105086

Actions (login required)

View Item