2018
DOI: 10.48550/arxiv.1811.01510
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Complexity Estimates for Fourier-Motzkin Elimination

Abstract: In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' work and can also be used to remove all the redundant inequalities in the input system. Moreover, our method only uses arithmetic operations on matrices and avoids resorting to linear programming techniques. Algebraic complexity estimates and experimental results show that our method outperforms alternative approaches, in particular t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…However, the downside of the FME is that the number of inequalities grows doubly exponentially [50,51]. At most, one can expect to get 4ð k 4 Þ…”
Section: Plos Onementioning
confidence: 99%
“…However, the downside of the FME is that the number of inequalities grows doubly exponentially [50,51]. At most, one can expect to get 4ð k 4 Þ…”
Section: Plos Onementioning
confidence: 99%