论文信息 - On the Complexity of a Special Basis Problem in LP

On the Complexity of a Special Basis Problem in LP

In a linear program (LP) in standard form, we show 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.

Katta G. Murty

[1] Katta G. Murty. A fundamental problem in linear inequalities with applications to the travelling salesman problem , 1972, Math. Program..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .