a) We cannot use = in an LP formulation.

a) In an LP, best corner point feasible solution must be an optimal solution.

a) A problem cannot have multiple optimal solutions.

a) Number of feasible solutions in an LP problem can be infinitely many.

a) At each Simplex iteration, basic variables must satisfy the canonical form.

a) For a maximization problem, the nonbasic variable with the most positive z^th row coefficient will be the entering variable.

a) For a maximization problem, if all of the z^th row coefficients are greater than equal to 0, the optimal solution is obtained.

a) For a minimization problem, the nonbasic variable with the most positive z^th row coefficient will be the entering variable.

a) For a minimization problem, if all of the z^th row coefficients are greater than equal to 0, the optimal solution is obtained.

a) From one Simplex iteration to another, objective function value should improve or at least stay the same.

a) In the final tableau, if the z^th row coefficient of a nonbasic variable is 0, the problem has multiple optimal solution.

a) If a final solution of Big-M or Phase I of Two-Phase method yields at least one artificial variable greater than zero, then the problem has no feasible solutions.

a) If a final solution of Big-M or Phase I of Two-Phase method yields all of the artificial variables equals to zero, then the problem could have either a single optimal solution or unbounded solution or multiple optimal solution.

a) In a simplex tableau, values in the solution column must be positive for each constraint.