10. The simplex method is a step - by - step procedure for finding the optimal solution to a linear programming problem. To apply simplex method to solving a linear programming problem, it has to be ensured that a. All the variables in the problem are non - negative b. All the values on the RHS of constraints are non - negative. C. All the coefficient of the constraint must be non - negative d. all the above are correct e. Only a and b