June 2006
Beginner
793 pages
20h 59m
English
A linear programming problem is said to be infeasible if there is no solution that satisfies all the constraints. It represents a state of inconsistency in the set of constraints. Under the Simplex Method, the problem is said to have no feasible solution if at least one of the artificial variable remains in the final simplex table as basic variable with non-zero quantity.
Read now
Unlock full access