Reduced costs of a linear programming problem

234 Views Asked by At

If I have a linear programming problem in standard form, how can I prove that:

If $x^*$ is the unique optimal solution of the LP problem, then the reduced costs of all nonbasic variables are strictly positive ??

1

There are 1 best solutions below

0
On

I suggest proving the contrapositive. Suppose some nonbasic variable has nonpositive reduced cost. What happens if you pivot?