Feasibility and Infeasibility in Optimization¶
Chinneck, J. W. (2008). Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. Springer.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Intersection
- The prime's directed-relaxation guidance is exact here: loosening a binding constraint enlarges the polytope; loosening a slack one does nothing, exactly the structural reason Phase I of the simplex method and irreducible- infeasible-subset analysis target specific constraints.
This sourceTreats LP infeasibility (empty intersection of constraints) and irreducible infeasible subsets / Phase I methods that target the binding constraints to relax.
- The prime's directed-relaxation guidance is exact here: loosening a binding constraint enlarges the polytope; loosening a slack one does nothing, exactly the structural reason Phase I of the simplex method and irreducible- infeasible-subset analysis target specific constraints.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:ec1f47249af4 · see in the full table