Question:-
Which one of the following is true in case of simplex method of linear programming ?
Option (A)
The constants of constraints equation may be positive or negative
Option (B)
Inequalities are not converted into equations
Option(C)
It cannot be used for two-variable problems
Option(D)
The simplex algorithm is an iterative procedure
Correct Option:
(D)
Question Solution:
Simplex method of linear programming is an iterative procedure.
question-answer-faq-8941