Detecting IIS in infeasible linear programmes using techniques from goal programming
From MaRDI portal
Publication:2563884
Recommendations
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Approaches to Diagnosing Infeasible Linear Programs
Cites work
- A review of goal programming and its applications
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- scientific article; zbMATH DE number 47228 (Why is no real title available?)
- scientific article; zbMATH DE number 3594862 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Irreducibly inconsistent systems of linear inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- MINOS(IIS): Infeasibility analysis using MINOS
Cited in
(21)- On optimal zero-preserving corrections for inconsistent linear systems
- Consistency, redundancy, and implied equalities in linear systems
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Interactive group decision making procedure under incomplete information
- On exact selection of minimally unsatisfiable subformulae
- Goal programming for decision making: An overview of the current state-of-the-art
- Resolving inconsistencies among constraints on the parameters of an MCDA model
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Automatic repair of convex optimization problems
- Hildreth's algorithm with applications to soft constraints for user interface layout
- Generalized filtering algorithms for infeasibility analysis
- Infeasibility resolution based on goal programming
- Finding Guaranteed MUSes Fast
- Preferential reducts and constructs in robust multiple criteria ranking and sorting
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Error correction for massive datasets
- K-best feasible clusters - ranking optimal solutions from an infeasible LP
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
- Diagnosing infeasible optimization problems using large language models
- Extending linear relaxation for non-square matrices and soft constraints
- Solution techniques for the large set covering problem
This page was built for publication: Detecting IIS in infeasible linear programmes using techniques from goal programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563884)
