Time Left - 15:00 mins
GATE 2023 II Linear Programming Problem II Quiz 52
Attempt now to get your rank among 36 students!
The leaving basic variable in a maximizing simplex method is the basic variable that __________.
Artiﬁcial variables are used in the simplex method to
We have a closed region with x1 & x2 be any two points belonging to that region, such that x1 & x2, this closed region is called convex if all the points lying on __________ line also belong to the same closed region.
If at the optimum in a linear programming problem, a dual variable corresponding to a particular primal constraint is zero, then it means that
If the slope of any constraint is equal to slope of objective function then the solution is ___________.
A primal problem is having 2 variables and 3 constraints then its dual will have
- 36 attempts
- 0 upvotes
- 0 comments
Oct 25ESE & GATE ME