arXiv Analytics

Sign in

arXiv:1807.01382 [math.OC]AbstractReferencesReviewsResources

A simplex algorithm for rational CP-factorization

Mathieu Dutour Sikirić, Achill Schürmann, Frank Vallentin

Published 2018-07-03Version 1

In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization.

Comments: 15 pages
Categories: math.OC, math.NT
Related articles:
arXiv:1905.09636 [math.OC] (Published 2019-05-23)
A Simple Rule to find a Basic Feasible Solution
arXiv:2212.08178 [math.OC] (Published 2022-12-15)
Benders Decomposition for Bi-objective Linear Programs
arXiv:1912.05712 [math.OC] (Published 2019-12-12)
Short simplex paths in lattice polytopes

Links

Toolbox