Some results concerning post-infeasibility analysis
From MaRDI portal
Publication:1328606
DOI10.1016/0377-2217(94)90152-XzbMath0806.90082OpenAlexW1993943649MaRDI QIDQ1328606
Publication date: 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90152-x
Related Items (25)
Some approaches to the solution of optimization problems in supervised learning ⋮ K-best feasible clusters - ranking optimal solutions from an infeasible LP ⋮ 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 ⋮ A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set ⋮ Feasibility in reverse convex mixed-integer programming ⋮ Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models ⋮ Preferential reducts and constructs in robust multiple criteria ranking and sorting ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ An optimal randomized algorithm for \(d\)-variate zonoid depth ⋮ Feasible partition problem in reverse convex and convex mixed-integer programming ⋮ 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 ⋮ Generating all vertices of a polyhedron is hard ⋮ Conflict Analysis for MINLP ⋮ 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 ⋮ Linearly constrained global optimization: a general solution algorithm with applications.
Cites Work
- Unnamed Item
- Unnamed Item
- Irreducibly inconsistent systems of linear inequalities
- Computer-assisted analysis for diagnosing infeasible or unbounded linear programs
- Approaches to Diagnosing Infeasible Linear Programs
- Identifying Minimally Infeasible Subsystems of Inequalities
- Locating Minimal Infeasible Constraint Sets in Linear Programs
This page was built for publication: Some results concerning post-infeasibility analysis
