Pages that link to "Item:Q2563884"
From MaRDI portal
The following pages link to Detecting IIS in infeasible linear programmes using techniques from goal programming (Q2563884):
Displaying 20 items.
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- On optimal zero-preserving corrections for inconsistent linear systems (Q1041447) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Interactive group decision making procedure under incomplete information (Q1610174) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Goal programming for decision making: An overview of the current state-of-the-art (Q1806868) (← links)
- Resolving inconsistencies among constraints on the parameters of an MCDA model (Q1869532) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Hildreth's algorithm with applications to soft constraints for user interface layout (Q2351069) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- Infeasibility resolution based on goal programming (Q2459385) (← links)
- Finding Guaranteed MUSes Fast (Q3502716) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- Error correction for massive datasets (Q5317751) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Diagnosing infeasible optimization problems using large language models (Q6655267) (← links)
