1
GATE ME 2023
MCQ (Single Correct Answer)
+1
-0.33

Which one of the options given represents the feasible region of the linear programming model:

š‘€š‘Žš‘„š‘–š‘šš‘–š‘§š‘’ 45š‘‹1 + 60š‘‹2

š‘‹1 ≤ 45

š‘‹2 ≤ 50

10š‘‹1 + 10š‘‹2 ≄ 600

25š‘‹1 + 5š‘‹2 ≤ 750

GATE ME 2023 Industrial Engineering - Linear Programming Question 1 English
A
Region P
B
Region Q
C
Region R
D
Region S
2
GATE ME 2022 Set 1
MCQ (Single Correct Answer)
+1
-0.33
In a linear programming problem, if a resource is not fully utilized, the shadow price of that resource is
A
positive
B
negative
C
zero
D
infinity
3
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.
4
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