9. Consider each of the following statements and state whether it is true or false. In case it is false, write the correct statement.

(i) Each inequality constraint in a linear programming problem adds only one variable, when it is solved by the simplex method.

(ii) All the slack, surplus and artificial variables are included in the basis of the first simplex tableau.

(iii) If optimal solution to an LPP is degenerate, it is of no consequence to the manager.

(iv) Any solution which satisfies at least one of the constraints in an LPP is included in the feasible region of the problem.

(v) For solving by simplex method, only an artificial variable is needed to be introduced if a constraint in an LPP involves an equation. Slack and surplus variables are not required in such a case.