Approaches to Diagnosing Infeasible Linear Programs
From MaRDI portal
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
(22)- On optimal zero-preserving corrections for inconsistent linear systems
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Some results concerning post-infeasibility analysis
- 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
- Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables
- Analyzing infeasible nonlinear programs
- The ANALYZE rulebase for supporting LP analysis
- Automatic repair of convex optimization problems
- 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
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- A new approach to partial MUS enumeration
- An approach to the analysis of improper problems of linear programming
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- scientific article; zbMATH DE number 1092947 (Why is no real title available?)
- Computer Codes for the Analysis of Infeasible Linear Programs
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Explanations of unsatisfiability beyond minimal subsets
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)