Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
From MaRDI portal
Publication:4354937
DOI10.1287/ijoc.9.2.164zbMath0885.90077OpenAlexW2023761583MaRDI QIDQ4354937
Publication date: 3 May 1998
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.9.2.164
Related Items (19)
Solution techniques for the large set covering problem ⋮ HySAT: An efficient proof engine for bounded model checking of hybrid systems ⋮ Irreducible infeasible subsystems of semidefinite systems ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ Valid cycles: A source of infeasibility in open shortest path first routing ⋮ Generalized filtering algorithms for infeasibility analysis ⋮ Infeasibility resolution based on goal programming ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ Efficient algorithms for finding critical subgraphs ⋮ Identifying relatively irreducible infeasible subsystems of linear inequalities ⋮ Automatic repair of convex optimization problems ⋮ Optimization approaches to supervised classification ⋮ Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables ⋮ IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems ⋮ On optimal zero-preserving corrections for inconsistent linear systems ⋮ Detecting IIS in infeasible linear programmes using techniques from goal programming
Uses Software
This page was built for publication: Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
