K-best feasible clusters - ranking optimal solutions from an infeasible LP

DOI10.1080/03155986.2020.1729064MaRDI QIDQ5882398zbMATH OpenOpenAlexFDO

Authors Paula Amaral, Pedro Barahona

Publication date 15 March 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2020.1729064

zbMATH Keywords

infeasibility analysiscomputer assisted methodsranking of solutionsfeasible clustersinfeasible LP

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Linear programming (90C05)

Recommendations

• Locating Minimal Infeasible Constraint Sets in Linear Programs
• Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Experiments with conflict analysis in mixed integer programming
• An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem

Cites work

• scientific article; zbMATH DE number 57208 (Why is no real title available?)
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
• An LP-based algorithm for the correction of inconsistent linear equation and inequality systems
• Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
• Connections between the total least squares and the correction of an infeasible system of linear inequalities
• Consistency of a linear system of inequalities
• Detecting IIS in infeasible linear programmes using techniques from goal programming
• INCONSISTENT STRUCTURES OF LINEAR SYSTEMS
• Identifying Minimally Infeasible Subsystems of Inequalities
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
• Irreducibly inconsistent systems of linear inequalities
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• On optimal zero-preserving corrections for inconsistent linear systems
• Some results concerning post-infeasibility analysis
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System

Cited in

(2)

• The recommender problem with convex hulls
• Human-centred feasibility restoration in practice

This page was built for publication: K-best feasible clusters - ranking optimal solutions from an infeasible LP

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