Computer-assisted analysis for diagnosing infeasible or unbounded linear programs

DOI10.1007/BFB0121180MaRDI QIDQ3773689zbMATH OpenOpenAlexFDO

Authors Harvey J. Greenberg

Publication date 1987

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121180

zbMATH Keywords

coefficient screeningcomputer-assisted analysisinfeasibilityinfeasible or unbounded linear programspath or cycle generationsparse matricessuccessive reduction of bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Methods of successive quadratic programming type (90C55)

Recommendations

• Computer Codes for the Analysis of Infeasible Linear Programs
• Approaches to Diagnosing Infeasible Linear Programs
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
• Enhancements of ANALYZE
• Locating Minimal Infeasible Constraint Sets in Linear Programs

Cited in

(14)

• On optimal zero-preserving corrections for inconsistent linear systems
• MINOS(IIS): Infeasibility analysis using MINOS
• Some results concerning post-infeasibility analysis
• Consistency, redundancy, and implied equalities in linear systems
• Analyzing infeasible nonlinear programs
• Analysis of structure in fuzzy linear programs
• The ANALYZE rulebase for supporting LP analysis
• Automatic repair of convex optimization problems
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
• Approaches to Diagnosing Infeasible Linear Programs
• Enhancements of ANALYZE
• Computer Codes for the Analysis of Infeasible Linear Programs
• K-best feasible clusters - ranking optimal solutions from an infeasible LP
• Constraint propagation, relational arithmetic in AI systems and mathematical programs

Describes a project that uses

Uses Software

• PERUSE

This page was built for publication: Computer-assisted analysis for diagnosing infeasible or unbounded linear programs

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