A note on detecting simple redundancies in linear systems

Authors:
R. E. Bixby;D. K. Wagner
Affiliations:
Department of Mathematical Sciences, Rice University, Houston, TX 77251, USA;School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA
Venue:
Operations Research Letters
Year:
1987

Citing 3
Cited 2

Stable Sorting in Asymptotically Optimal Time and Extra Space

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Finding duplicate rows in a linear programming model

Operations Research Letters

A constraint selection technique for a class of linear programs

Operations Research Letters
Using dual presolving reductions to reformulate cumulative constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two efficient algorithms are presented that, for a given linear system Ax = b, eliminate equations that are non-zero multiples of other equations. The second algorithm runs in linear time when the entries of A are +1, -1 or 0.