Locating Minimal Infeasible Constraint Sets in Linear Programs

DOI10.1287/IJOC.3.2.157zbMATH Open0755.90055OpenAlexW2160089068MaRDI QIDQ4025905FDOQ4025905

Authors: John W. Chinneck, Erik W. Dravnieks

Publication date: 18 February 1993

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

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

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

minimal sets of inconsistent constraints filtering routines minimal infeasible constraint sets very large set of constraints

Mathematics Subject Classification ID

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

Cited In (78)

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

Uses Software

MINOS

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)