A note on detecting simple redundancies in linear systems

DOI10.1016/0167-6377(87)90004-6zbMath0624.90061OpenAlexW2064927288MaRDI QIDQ579125

Donald K. Wagner, Robert E. Bixby

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/101602

zbMATH Keywords

efficient algorithms

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (13)

A constraint selection technique for a class of linear programs ⋮ Algorithms for highly symmetric linear and integer programs ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Presolving linear bilevel optimization problems ⋮ Progress in presolving for mixed integer programming ⋮ The structure of bases in bicircular matroids ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ A computational study of redundancy in randomly generated polytopes ⋮ A constraint selection technique in limit analysis ⋮ On the complexity of recognizing a class of generalized networks ⋮ Uncovering generalized-network structure in matrices ⋮ Nonseparating Cocircuits in Binary Matroids

Cites Work

• Finding duplicate rows in a linear programming model
• On the computational power of pushdown automata
• Stable Sorting in Asymptotically Optimal Time and Extra Space
• Unnamed Item

This page was built for publication: A note on detecting simple redundancies in linear systems