Approaches to Diagnosing Infeasible Linear Programs

DOI10.1287/ijoc.3.3.253zbMath0753.90041OpenAlexW2045168006MaRDI QIDQ4015388

Harvey J. Greenberg, Frederic H. Murphy

Publication date: 13 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.3.3.253

zbMATH Keywords

infeasibility diagnosisinfeasible linear program

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

Some results concerning post-infeasibility analysis ⋮ A New Approach to Partial MUS Enumeration ⋮ The complexity and approximability of finding maximum feasible subsystems of linear relations ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Finding the minimum weight IIS cover of an infeasible system of linear inequalities ⋮ Reasoning on infeasibility in distributed collaborative computing environment ⋮ A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ Automatic repair of convex optimization problems ⋮ Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables ⋮ The ANALYZE rulebase for supporting LP analysis ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems ⋮ On optimal zero-preserving corrections for inconsistent linear systems

This page was built for publication: Approaches to Diagnosing Infeasible Linear Programs