Irreducibly inconsistent systems of linear inequalities

DOI10.1016/0377-2217(81)90177-6MaRDI QIDQ1156692zbMATH OpenOpenAlexFDO

Authors J. N. M. van Loon

Publication date 1981

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(81)90177-6

zbMATH Keywords

inconsistency conditionsirreducibly inconsistent systemssimplex methodsystems of linear inequalities

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Linear programming (90C05)

Cited in

(38)

• On optimal zero-preserving corrections for inconsistent linear systems
• Diagnosing infeasibilities in network flow problems
• 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
• 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
• Interactive group decision making procedure under incomplete information
• A new model for automated examination timetabling
• 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
• Analyzing infeasible nonlinear programs
• Resolving inconsistencies among constraints on the parameters of an MCDA model
• Debugging unsatisfiable constraint models
• Identifying relatively irreducible infeasible subsystems of linear inequalities
• Automatic repair of convex optimization problems
• 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
• Efficient algorithms for finding critical subgraphs
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• Fast, flexible MUS enumeration
• A new approach to partial MUS enumeration
• The AMPL modeling language: an aid to formulating and solving optimization problems
• INCONSISTENT STRUCTURES OF LINEAR SYSTEMS
• Clingo goes linear constraints over reals and integers
• Preferential reducts and constructs in robust multiple criteria ranking and sorting
• Symmetry-driven network reconstruction through pseudobalanced coloring optimization
• Deletion presolve for accelerating infeasibility diagnosis in optimization models
• K-best feasible clusters - ranking optimal solutions from an infeasible LP
• Human-centred feasibility restoration in practice
• Explanations of unsatisfiability beyond minimal subsets
• Cost-minimal parameter correction subsets for unsatisfiable constraint problems
• Explainability results for the rotating workforce scheduling problem
• Solution techniques for the large set covering problem
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation

This page was built for publication: Irreducibly inconsistent systems of linear inequalities

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