Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Industrial Engineering Operations Research Linear Programming
Which one of the following is true in case of simplex method of linear programming?
1
The constants of constraints equation may be positive or negative
2
Inequalities are not converted into equations
3
It cannot be used for two-variable problems
4
The simplex algorithm is an iterative procedure