Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
From MaRDI portal
Publication:3773689
DOI10.1007/BFb0121180zbMath0634.90043OpenAlexW31167091MaRDI QIDQ3773689
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121180
sparse matricesinfeasibilitycomputer-assisted analysiscoefficient screeninginfeasible or unbounded linear programspath or cycle generationsuccessive reduction of bounds
Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of successive quadratic programming type (90C55)
Related Items
K-best feasible clusters - ranking optimal solutions from an infeasible LP ⋮ Some results concerning post-infeasibility analysis ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Constraint propagation, relational arithmetic in AI systems and mathematical programs ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ Automatic repair of convex optimization problems ⋮ Analysis of structure in fuzzy linear programs ⋮ The ANALYZE rulebase for supporting LP analysis ⋮ On optimal zero-preserving corrections for inconsistent linear systems ⋮ MINOS(IIS): Infeasibility analysis using MINOS
Uses Software