GATE 2022 ME: Industrial Engineering Quiz - 1

Attempt now to get your rank among 560 students!

Question 1

Simplex method of solving linear programming problem uses ____.

• AAll the points in the feasible region
• BOnly the corner points of the feasible region
• CIntermediate points within the infeasible region.
• DOnly the interior points in the feasible region.

Question 2

A feasible solution of a linear programming problem

• Amust satisfy all the constraints simultaneously
• Bmust satisfy some of the constraints at a time
• Ccan only be corner points of the feasible region
• Dmust optimize the value of objective function

Question 3

Optimal solution of any linear programming problem is always obtained from____.

• ABinding Constraints
• Bnon-binding constraints
• Cany of the given constraints
• Dpoint of the intersection of the any of the given constraints

Question 4

For the linear programming problem:
Maximize: Z = 3X₁ + 2 X₂  
Subject to:




The above problem has __________.

• Aunbounded solution
• Binfeasible solution
• Calternative optimum solution
• Ddegenerate solution

Question 5

After some simplex iterations, the following table is obtained:

From this, one can conclude that

• AThe LPP has a unique optimal solution
• BThe LPP is infeasible
• CThe LPP is unbounded
• DThe LPP has multiple optimal solution

Question 6

If in any step of simplex method, replacement ratio values are either negative or infinite, then the solution will be

• AMulti-optimum
• BDegenerate
• CUnbounded
• DInfeasible

• 560 attempts
• 2 upvotes
• 0 comments