Pages that link to "Item:Q1328606"
From MaRDI portal
The following pages link to Some results concerning post-infeasibility analysis (Q1328606):
Displaying 27 items.
- Some approaches to the solution of optimization problems in supervised learning (Q267571) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Infeasibility analysis for systems of quadratic convex inequalities (Q1296129) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities (Q1380442) (← links)
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem (Q1380443) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Connections between the total least squares and the correction of an infeasible system of linear inequalities (Q1765915) (← links)
- A framework for optimal correction of inconsistent linear constraints (Q1774520) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- Infeasibility resolution based on goal programming (Q2459385) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Analysis-aware defeaturing: Problem setting and <i>a posteriori</i> estimation (Q5068834) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
