The answer is Yes. A Linear Programming problem that is both primal and dual infeasible does always have a (not necessarily unique) basis that is both primal and dual infeasible.
Goswin
- 21
- 5