Identifying relatively irreducible infeasible subsystems of linear inequalities

DOI10.1007/s10479-021-04126-9OpenAlexW3164813228MaRDI QIDQ2241565

Michael Poss, Jérémy Omer

Publication date: 9 November 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04126-9

zbMATH Keywords

linear programmingsystems of linear inequalitiesconflict analysisirreducible infeasible set

Mathematics Subject Classification ID

Theory of software (68Nxx) Basic linear algebra (15Axx)

Cites Work

• Irreducibly inconsistent systems of linear inequalities
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• A note on the selection of Benders' cuts
• Julia: A Fresh Approach to Numerical Computing
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Identifying Minimally Infeasible Subsystems of Inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Linear Programming
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program

This page was built for publication: Identifying relatively irreducible infeasible subsystems of linear inequalities