RAJIV GANDHI UNIVERSITY OF KNOWLEDGE TECHNOLOGIES

DEPARTMENT OF MANAGEMENT STUDIES

Subject: Introduction to Operational research Year/SEM/MT:E4/I/2

Subject Code: Date:11/10/2014
Time:45 Minutes Max.Marks:15

SECTION-A Marks:10

Answer ALL the questions. Each carries 1 mark. (10X1=10 Marks)

Q01).The following are constraints which had slack variables added.

2X1+4X2+S1=20 ; 6X1+4X2+S2=36
If X1=2 and X2=2, what are the values for S1 and S2?

A) S1=20, S2=36
B) S1=16, S2=32
C) S1=8, S2=16
D) S1=0, S2=0

Q02).Linear programming problem involving more than two variables can be solved by

A) Simplex method
B) Big-M method
C) Graphical method
D) None of the above

Q03). To formulate a problem for solution by the simplex method, we must add artificial
variable to

A) Only equality constraints

B) Only >constraint
C) Both A and B
D) None of the above
Q04). Max Z =3X1+2X2 , subject to the constraints: X1+X2< 4, X1-X2< 2.Where
X1, X2 >0.Then Z=11.Where

A) X1=3,X2=1
B) X1=1,X2=4
C) X1=1,X2=3
D) X1=3,X2=2

Q05).The solution for the following L.P.P is __________.

Max Z= 6X1+4X2,
S.T.C; 2X1+3X2 < 30, 3X1+2X2< 24 ,X1+X2 >3.where X1, X2 >0.

A) Infeasible
B) Degenerate
C) Unbounded
D) Multiple

Q06).If an artificial variable(with some positive value) is present in the basic variable column of
optimal simplex table, then the solution is

A) Infeasible
B) Degenerate
C) Unbounded
D) Non-degenerate

Q07).When no variable is ready to leave the basis though a variable is ready to enter, then the
solution is

A) Infeasible
B) Degenerate
C) Unbounded
D) Non-degenerate

Q08).In general, degeneracy occurs in ________________ stages.

A) 1
B) 2
C) 3
D) 4
Q09).consider the following linear programming problem
Max Z=40X1+30X2+60X3
Subject to : X1+X2+X3 < 90; 12X1+8X2+10X3 < 90;X1=20;X3>4

How many slack, surplus, and artificial variables would be necessary if the simplex algorithm
were used to solve this problem?

A) 3 slack, 6surplus, and 6 artificial

B) 2 slack, 1surplus, and 2 artificial
C) 1 slack, 2surplus, and 2 artificial
D) 1slack, 2surplus, and 1artificial

Q10). The solution for the following L.P.P is __________.

Max Z= 4X1+3X2, S.T.C; X1 < 4.5 , 4 X1+3X2< 24, X2< 6 where X1,X2 >0.

A) Infeasible
B) Degenerate
C) Unbounded
D) Multiple

SECTION-B Marks:5

Descriptive Question [Answer any ONE question- carries 5 marks])

1.Find the optimal solution.

Max Z=6X1+8X2

Subject to: 5X1+10X2> 60 ; 4X1+4X2< 40,Where X1,X2 >0.

2. Find the optimal solution.

Min Z=4X1+3X2

Subject to: 2X1+X2> 10 ; -3X1+2X2< 6,2X1+X2> 6 Where X1,X2 >0.