Department of Rural Management

School of Management & Commerce

Babasaheb Bhimrao Ambedkar University [A Central University]
End Semester Examination, May, 2022
BBA 4th Semester

Paper Name: Operation Research Max Time: 2Hrs

Paper Code: BBA–405 Max. Marks: 70

INSTRUCTION
1. This question paper is divided in three sections.
2. Additional 45 minutes will be given to the students for downloading the
question paper and uploading of answer sheets.
3. Sit on a seat where you can be invigilated.
4. Keep your video camera and mice on all the time during the examination.
5. Further instructions are given in each section

SECTION A
INSTRUCTION
1. Total 4 questions are in this section.
2. All questions are compulsory.
3. Each question carries 5 marks.

Q. 1. Solve the following LP problem graphically:

Minimize Z = 45X1 + 55X2

Subject to X1 + 2X2 ≤ 40

2X1 + 3X2 ≤ 80

X1 - X2 ≤ 8

X1 and X2 ≥ 0

Q. 2. A college having a degree programme for which the effective semester time available is
very less and the programme requires field work. Hence, a few hours can be saved from the total
number of class hours, can be utilized for the field work. Based on the past experience, the
college has estimated the number of hours required to teach each subject by each faculty. The
course in its present semester has 5 subjects and the college has considered 6 existing faculty
members to teach these courses. The objective is to assign the best 5 teachers out of these 6
faculty members to teach 5 different subjects so that the total number of class hours required is
minimized. The data of this problem is summarized below in table. Solve this assignment
problem optimally.

Subject

1 2 3 4 5
1 60 58 62 76 80
2 86 74 64 70 76
Faculty 3 68 82 66 82 68
4 78 72 86 64 72
5 64 98 70 80 74
6 72 84 70 88 84

Q. 3. Consider the following transportation problem given below:

Market

1 2 3 4 5 Supply
1 3 4 6 8 9 20
Source 2 2 10 1 5 8 30
3 7 11 20 40 3 15
4 2 1 9 14 16 13
Demand 40 6 8 18 6

Find the initial basic feasible solution and compute its total cost using North-west Corner Cell
Method and Least Cost cell Method.

Q. 4. Solve the following game:

Player B

1 2 3

1 -3 4 3

Player A 2 7 8 5
6 2 9
3

SECTION B
INSTRUCTION
1. Total 3 questions are in this section.
2. Attempt any 2 questions.
3. Each question carries 10 marks.
Q. 5. Solve the following LP problem using simplex method:

Maximize Z = 3X1 + 2X2 +5X3

Subject to

X1 + X2 + X3 ≤ 9

2X1 + 3X2 + 5X3 ≤ 30

2X1 - X2 - X3 ≤ 8

X1, X2 and X3 ≥ 0

Q. 6. Consider the following transportation problem given below:

Market

1 2 3 4 5 Supply
1 30 6 48 42 30 900
Plant 2 18 54 36 39 48 1500
3 24 12 42 36 30 2475
4 42 66 60 24 54 1125
Demand 1050 1200 750 450 1200

Find the initial basic feasible solution using Vogel’s approximation method and optimize the
initial basic feasible solution using U-V method.

Q. 7. The details of a project are given below:

Activity P Q R S T U V W X Y Z
Immediate - - - P,Q,R P,Q,R S S,T S,T U V W
Predecessor(s)
Duration 8 6 4 10 12 14 12 18 8 12 16
(weeks)

Find the critical path and calculate total floats and free floats for every non-critical activity.

SECTION C
INSTRUCTION
1. Total 3 questions are in this section.
2. Attempt any 2 questions.
3. Each question carries 15 marks.
Q. 8. Solve the following LP problem using simplex method:

Maximize Z = 40X1 + 20X2 +30X3

Subject to

8X1 + 6X2 + 2X3 ≤ 60

5X1 + X2 + 6X3  40

2X1 + 6X2 + 3X3 ≤ 30

X1, X2 and X3 ≥ 0

Q. 9. Consider the following table summarizing the detail of a project:

Activity Immediate Duration (Weeks)

Predecessor (s) a m b
A - 4 4 10
B - 1 2 9
C - 2 5 14
D A 1 4 7
E A 1 2 3
F A 1 5 9
G B, C 1 2 9
H C 4 4 4
I D 2 2 8
J E, G 6 7 8
K F, H 2 2 8
L F, H 5 5 5
M I, J, K 1 2 9
N L 6 7 8
(a) Construct the project network.

(b) What is the probability of completing the project on or before 35 weeks?

Q. 10. Consider the following matrix of Player A as shown below and solve it optimally using
graphical method.

Player B

1 2 3 4 5

Player A 1 4 2 5 -6 6

2 7 -9 7 4 8