Linear programming, theory of alternatives

55 Views Asked by At

I need help proving this: $Ax<b$ is feasible iff $y=0$ is the only solution of $y\geq0, yA=0, yb\leq0$. It is referred to Carver's theorem (1921) is some books.