Time Left - 06:00 mins

SSC-JE ME || Industrial Engineering 1

Attempt now to get your rank among 110 students!

Question 1

The most distinguishing feature of a linear programming problem is

Question 2

Simplex method of solving linear programming problem uses ____.

Question 3

A feasible solution of a linear programming problem

Question 4

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 5

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

Question 6

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

The above problem has __________.

Question 7

After some simplex iterations, the following table is obtained:

From this, one can conclude that

Question 8

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

Question 9

In a simplex optimum table of two different cases:

Case (i): Optimum table has all variables zero other than basic variable.

Case (ii): Optimum table has an artificial variable.

Then the solution of these simplex cases will be respectively __________.

Question 10

If in a simplex tableau when all cj−zj values imply optimal solution but at least one of artiﬁcial variables appear in the basis with a positive value, then the solution is called

110 attempts
0 upvotes
0 comments

Tags :

AE & JE Exams Mechanical Engineering

Nov 25AE & JE Exams