Which of the following is true in case of simplex method of linear programming?
(a) The constants of constrains equation may be positive or negative
(b) Inequalities are not converted into equations
(c) It cannot be used for two – variable problems
(d) The simplex algorithm is an iterative procedure