A note on resolving infeasibility in linear programs by constraint relaxation
From MaRDI portal
Publication:2367035
DOI10.1016/0167-6377(93)90079-VzbMath0771.90068MaRDI QIDQ2367035
Publication date: 16 August 1993
Published in: Operations Research Letters (Search for Journal in Brave)
polynomial-time solvabilitytotally unimodular matrixpost-infeasibility analysisconstraint relaxation
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (13)
The maximum feasible subset problem (maxFS) and applications ⋮ 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 ⋮ Faster maximum feasible subsystem solutions for dense constraint matrices ⋮ Efficient MIP techniques for computing the relaxation complexity ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ A note on unsolvable systems of max-min (fuzzy) equations ⋮ Automatic repair of convex optimization problems ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems ⋮ Resolving infeasibility in extremal algebras
Cites Work
This page was built for publication: A note on resolving infeasibility in linear programs by constraint relaxation
