Locating Minimal Infeasible Constraint Sets in Linear Programs
From MaRDI portal
Recommendations
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Generalized filtering algorithms for infeasibility analysis
- Computer Codes for the Analysis of Infeasible Linear Programs
Cited in
(83)- A hybrid algorithm for solving linear inequalities in a least squares sense
- A Benders approach for computing lower bounds for the mirrored traveling tournament problem
- On optimal zero-preserving corrections for inconsistent linear systems
- Finding duplicate rows in a linear programming model
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Diagnosing infeasibilities in network flow problems
- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- MINOS(IIS): Infeasibility analysis using MINOS
- Some results concerning post-infeasibility analysis
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Sensivitiy analysis for assessing preferentially independent order relations
- Interactions between nonlinear programming and modeling systems
- Formulation assistance for global optimization problems
- Consistency, redundancy, and implied equalities in linear systems
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Reasoning on infeasibility in distributed collaborative computing environment
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Finding minimum stopping and trapping sets: an integer linear programming approach
- Minimal sets on propositional formulae. Problems and reductions
- On the choice of parameters in the residual method for the optimal correction of improper problems of convex optimization
- Optimization approaches to supervised classification
- Connections between the total least squares and the correction of an infeasible system of linear inequalities
- A framework for optimal correction of inconsistent linear constraints
- On exact selection of minimally unsatisfiable subformulae
- Analyzing infeasible nonlinear programs
- Harvey Greenberg: analyzing infeasible mathematical programs
- Strengthening of feasibility cuts in logic-based benders decomposition
- Identifying relatively irreducible infeasible subsystems of linear inequalities
- Automatic repair of convex optimization problems
- Feasible partition problem in reverse convex and convex mixed-integer programming
- Minimal infeasible constraint sets in convex integer programs
- Hildreth's algorithm with applications to soft constraints for user interface layout
- A note on resolving infeasibility in linear programs by constraint relaxation
- Irreducible infeasible subsystems of semidefinite systems
- Generalized filtering algorithms for infeasibility analysis
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Guided design search in the interval-bounded sailor assignment problem
- Extracting unsatisfiable cores for LTL via temporal resolution
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
- MCS Extraction with Sublinear Oracle Queries
- Efficient reasoning for inconsistent Horn formulae
- Computing a Pareto-optimal solution for multi-objective flexible linear programming in a bipolar framework
- On improving MUS extraction algorithms
- Propositional SAT solving
- A new approach to partial MUS enumeration
- The AMPL modeling language: an aid to formulating and solving optimization problems
- A General Framework for the Analysis of Sets of Constraints
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- scientific article; zbMATH DE number 57208 (Why is no real title available?)
- Approaches to Diagnosing Infeasible Linear Programs
- Identifying Minimally Infeasible Subsystems of Inequalities
- scientific article; zbMATH DE number 572147 (Why is no real title available?)
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- Feasibility in reverse convex mixed-integer programming
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Algorithms for computing minimal equivalent subformulas
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
- Preferential reducts and constructs in robust multiple criteria ranking and sorting
- scientific article; zbMATH DE number 912665 (Why is no real title available?)
- Localizing and Diagnosing Infeasibilities in Networks
- ASP modulo CSP: the clingcon system
- Irreducible infeasible sets in convex mixed-integer programs
- Conflict Analysis for MINLP
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Coupling input-output analysis with multiobjective linear programming models for the study of economy-energy-environment-social (E3S) trade-offs: a review
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
- 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
- Explanations of unsatisfiability beyond minimal subsets
- Extending linear relaxation for non-square matrices and soft constraints
- An interactive method of tackling uncertainty in interval multiple objective linear programming
- Solution techniques for the large set covering problem
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
This page was built for publication: Locating Minimal Infeasible Constraint Sets in Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025905)
