I have a LP with constricting constraints, i.e. there is no feasible region. How would I use the simplex method to show this?
After one iteration of the simplex method I have found no negative values in the row corresponding to the objective function, which causes the algorithm to terminate...but so what..?
Any input/ideas?