On linear inequality systems without strongly redundant constraints

DOI10.1016/0377-2217(93)E0333-SzbMath0906.90115OpenAlexW2070576165WikidataQ59868875 ScholiaQ59868875MaRDI QIDQ1130083

Jean J. M. Derks

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0333-s

zbMATH Keywords

polyhedral coneslinear inequality systemsextreme directionsstrong redundancy

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• Some characterizations of convex polyhedra
• Unnamed Item

This page was built for publication: On linear inequality systems without strongly redundant constraints