Time Left - 15:00 mins

GATE 2023 || Industrial Engineering || Quiz 52

Attempt now to get your rank among 32 students!

Question 1

A feasible solution of a linear programming problem

Question 2

Solve the following linear programming problem by simplex method.
Maximize Description: D:\GradeStack Courses\GATE Tests (Sent by Ravi)\GATE-EE-ME-19-Mar\GATE-ME-2000_files\image278.png
Subject to Description: D:\GradeStack Courses\GATE Tests (Sent by Ravi)\GATE-EE-ME-19-Mar\GATE-ME-2000_files\image279.png
Description: D:\GradeStack Courses\GATE Tests (Sent by Ravi)\GATE-EE-ME-19-Mar\GATE-ME-2000_files\image280.png
What is the solution to the above problem?

Question 3

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

Question 4

For the linear programming problem:
Maximize: Z = 3X1 + 2 X2  
Subject to:




The above problem has __________.

Question 5

After some simplex iterations, the following table is obtained:
17.jpg
From this, one can conclude that

Question 6

If in any step of simplex method, replacement ratio values are either negative or infinite, then the solution will be
  • 32 attempts
  • 0 upvotes
  • 0 comments
Jun 28ESE & GATE ME