| Input: | Polytope P given as {x Î Rs : A x = b, x ³ 0}, a set S Í {1, ..., s} |
|---|---|
| Output: | "Yes" if there is a feasible basis with an index set containing S, "No" otherwise |
| Status (general): | NP-complete |
|---|---|
| Status (fixed dim.): | Polynomial time |
|
See Murty [49] (Garey and Johnson [23], Problem
[MP4]). For fixed dimension, one can enumerate all bases in
polynomial time.
The problem can be reformulated as follows. Let P be defined by a finite set H of affine halfspaces and let S be a subset of H. Does Ç {h Î H : h Ï S} contain a vertex which is also a vertex of P? |