A constraint selection technique for a class of linear programs

DOI10.1016/0167-6377(88)90027-2zbMath0648.90053OpenAlexW2066907087MaRDI QIDQ1105487

Wei Shih, Danny C. Meyers

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90027-2

zbMATH Keywords

heuristicconstraint selectionbinding constraints identification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems ⋮ A constraint selection technique in limit analysis ⋮ Unnamed Item

Cites Work

• A note on detecting simple redundancies in linear systems
• Redundancy in mathematical programming. A state-of-the-art survey
• Finding duplicate rows in a linear programming model
• On Trivial and Binding Constraints in Programming Problems
• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• The pivot and probe algorithm for solving a linear program
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems