Approaches to Diagnosing Infeasible Linear Programs

DOI10.1287/IJOC.3.3.253MaRDI QIDQ4015388zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
• Computer Codes for the Analysis of Infeasible Linear Programs
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Analyzing Infeasible Mixed-Integer and Integer Linear Programs

Cited in

(19)

• A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
• Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables
• Some results concerning post-infeasibility analysis
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• Automatic repair of convex optimization problems
• Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
• A new approach to partial MUS enumeration
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
• Consistency, redundancy, and implied equalities in linear systems
• Computer Codes for the Analysis of Infeasible Linear Programs
• Analyzing infeasible nonlinear programs
• An approach to the analysis of improper problems of linear programming
• On optimal zero-preserving corrections for inconsistent linear systems
• Explanations of unsatisfiability beyond minimal subsets
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• The ANALYZE rulebase for supporting LP analysis
• A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
• Reasoning on infeasibility in distributed collaborative computing environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015388)