Quantitative Techniques: Theory and Problems

MULTIPLE SOLUTION

Multiple solutions of a linear programming problem are solutions each of which maximize or minimize the objective function under Simplex Method. Under Simplex Method, the existence of multiple optimal solutions is indicated by a situation under which a non-basic variable in the final simplex table showing optimal solution to a problem, has a net zero contribution. In other words, if at least one of the non-basic variable in the (C_i - Z_j) row of the final simplex table has a zero value, it indicates that there is more than one optimal solution.