ExamSIDE
Questions (Powered by ExamGOAL)
Industrial Engineering
Queuing
Marks 1Marks 2Marks 5
Production Planning and Control
Marks 1Marks 2Marks 5
Line Balancing
Marks 2
Forecasting
Marks 1Marks 2
Linear Programming
Marks 1Marks 2Marks 5
Assignment
Marks 1Marks 2
Pert and Cpm
Marks 1Marks 2Marks 5
Inventory Control
Marks 1Marks 2Marks 5
Transportation
Marks 1Marks 2Marks 5
Scheduling
Marks 1Marks 2Marks 5
Previous
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
Previous
Questions Asked from Marks 1
GATE ME 2023 (1) GATE ME 2022 Set 1 (1) GATE ME 2010 (1) GATE ME 1996 (1)
GATE ME Subjects
Engineering Mechanics
Machine Design
Strength of Materials
Heat Transfer
Production Engineering
Industrial Engineering
Turbo Machinery
Theory of Machines
Engineering Mathematics
Fluid Mechanics
Thermodynamics
General Aptitude