Input: | Polytope P given as {, a set x Î R^{s} : A x =
b, x ³ 0}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 |