TITLE: How to find out whether linear programming problem is infeasible using simplex algorithm
QUESTION [7 upvotes]: So in http://econweb.ucsd.edu/~jsobel/172aw02/notes3.pdf, there is a mention about finding out whether linear programming (LP) problem is infeasible by simplex algorithm, but it does not actually go over it. How does one find whether LP is infeasible using simplex algorithm?

REPLY [2 votes]: In the final simplex table ,Zj-cj >= 0 than then it is called feasible solution, if zj-cj <0 in the last table value is negative then it is called infeasible solution.If all min(xb/xi) is negative then the problem is considered as infeasible