Tropicalizing the simplex algorithm

From MaRDI portal




Abstract: We develop a tropical analog of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m+n)) time, where m is the number of constraints and n is the dimension.



Cites work


Cited in
(38)






This page was built for publication: Tropicalizing the simplex algorithm

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