1
GATE ME 2010
MCQ (Single Correct Answer)
+1
-0.3
Simplex method of solving linear programming problem uses
A
all the points in the feasible region
B
only the corner points of the feasible region
C
intermediate points within the infeasible region
D
only the interior points in the feasible region.
2
GATE ME 1996
MCQ (Single Correct Answer)
+1
-0.3
If at the optimum in a linear programming problem, a dual variable corresponding to a particular primal constraint is zero, then it means that
A
Right hand side of the primal constraint can be altered without affecting the optimum solution
B
Changing the right hand side of the primal constraint will disturb the optimum solution
C
The objective function is unbounded
D
The problem is degenerate
GATE ME Subjects
Turbo Machinery
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12