Redundancy in linear inequality system

DOI10.1080/01630569808816843zbMath0906.90118MaRDI QIDQ4210734

J. A. Mira, Miguel Angel Goberna, G. Torregrosa

Publication date: 27 September 1998

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630569808816843

zbMATH Keywords

linear systems; redundant constraints; redundancy tests; real locally convex spaces

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

Saturation in linear optimization, Uniform saturation in linear inequality systems, Excess information in parametric linear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• General criteria for redundant and nonredundant linear inequalities
• A theory of linear inequality systems
• Minimal representation of convex polyhedral sets
• On the existence of solutions for linear inequality systems
• On infinite systems of linear inequalities
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• Semi-Infinite Programming: Theory, Methods, and Applications
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Redundante Ungleichungen bei linearen Ungleichungssystemen