General criteria for redundant and nonredundant linear inequalities

DOI10.1007/BF00938815zbMath0593.90048OpenAlexW2086659824MaRDI QIDQ1076606

B. George

Publication date: 1987

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00938815

zbMATH Keywords

system of linear inequalitiesnonredundant inequalitiesredundant inequalities

Mathematics Subject Classification ID

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

Related Items (6)

Consistency, redundancy, and implied equalities in linear systems ⋮ A novel approach to multiparametric quadratic programming ⋮ On polyhedral projection and parametric programming ⋮ Local tests for consistency of support hyperplane data. ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Redundancy in linear inequality system

Cites Work

• Unnamed Item
• Minimal representation of convex polyhedral sets
• On Trivial and Binding Constraints in Programming Problems
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Redundante Ungleichungen bei linearen Ungleichungssystemen

This page was built for publication: General criteria for redundant and nonredundant linear inequalities