On the complexity of a special basis problem in LP

http://deepblue.lib.umich.edu/bitstream/2027.42/6738/5/bam0399.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/6738/4/bam0399.0001.001.tx

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.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/30441/1/0000064.pd