Some results concerning post-infeasibility analysis
From MaRDI portal
(Redirected from Publication:1328606)
Recommendations
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- scientific article; zbMATH DE number 4068618
- A framework for optimal correction of inconsistent linear constraints
- Computer Codes for the Analysis of Infeasible Linear Programs
Cites work
- Approaches to Diagnosing Infeasible Linear Programs
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Irreducibly inconsistent systems of linear inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
Cited in
(28)- On optimal zero-preserving corrections for inconsistent linear systems
- On infeasibility of systems of convex analytic inequalities
- Infeasibility analysis for systems of quadratic convex inequalities
- 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
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- 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
- Linearly constrained global optimization: a general solution algorithm with applications.
- Feasible partition problem in reverse convex and convex mixed-integer programming
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem
- Infeasibility resolution based on goal programming
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
- An optimal randomized algorithm for \(d\)-variate zonoid depth
- Faster maximum feasible subsystem solutions for dense constraint matrices
- Some approaches to the solution of optimization problems in supervised learning
- Feasibility in reverse convex mixed-integer programming
- Preferential reducts and constructs in robust multiple criteria ranking and sorting
- Irreducible infeasible sets in convex mixed-integer programs
- Conflict Analysis for MINLP
- Analysis-aware defeaturing: Problem setting and a posteriori estimation
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- K-best feasible clusters - ranking optimal solutions from an infeasible LP
- The maximum feasible subset problem (maxFS) and applications
- Generating all vertices of a polyhedron is hard
- Curriculum-based university course timetabling considering individual course of studies
This page was built for publication: Some results concerning post-infeasibility analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328606)
