| Article ID: | iaor1995332 |
| Country: | Netherlands |
| Volume: | 47 |
| Issue: | 2 |
| Start Page Number: | 181 |
| End Page Number: | 185 |
| Publication Date: | Nov 1993 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Murty Katta G. |
In a linear program in standard form, the paper shows that the problem of finding a cheapest feasible basic vector among those containing a specified variable as a basic variable, is an NP-hard problem.