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.
Supported in partVerified against the publisher's abstract
Chinneck's monograph covers feasibility-seeking and the isolation of minimal infeasible subsets of constraints, but its abstract states no polytope geometry and no Phase I rationale.
“Part II provides algorithms for analyzing infeasibility by isolating minimal infeasible (or maximum feasible) subsets of constraints, or by finding the best repair for the infeasibility.”
- 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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:ec1f47249af4 · see in the full table