Roll.

No………………………… 1223055
rd
BBA 3 Semester Examination 4. Solve the following Linear Programming Problem trough simplex method:
Jan.2014 Max z = 3X1 + 2x2+ 5x3 (20)
Subject – Operation Research S.C X1 + 2X2 + X3 ≤ 430
Subject Code : MSL-205 3X1 + 2X3 ≤ 460
Time Allowed: 03 hours. Maximum Marks: 100 X1 + 4X2 ≤ 420
______________________________________________________________ X1, X2, X3 ≥ 0
Before answering the question paper the candidate should ensure that
they have been supplied the correct question paper. Complaints in this
regard, if any, shall not be entertained after the examination. SECTION B
_____________________________________________________________
Note: Question No. 1 is Compulsory and attempts any two questions from 5. Use MODI method to check optimality of the following transportation
each section. All questions carry equal marks. problem. (20)

1. Write short note on: (5x4) W W W W Capacit

a. Value of the game 1 2 3 4 y
b. Sequencing problem F1 19 30 50 10 7
c. Assignment Problem F2 70 30 40 60 9
d. Principle of Dominance F3 40 8 70 20 18
SECTION A Requiremen 5 8 7 14
t
2. Define Operations Research. Explain the different techniques of
Operations Research. (20)
6. There are seven jobs, each of which has to go through the machines A & B
3. A marketing manager has 5 salesmen and 5 districts. Considering the
in the order AB. Processing times in hours are given below: (20)
capabilities of the salesmen and nature of districts, the marketing manager
estimates of sales per month (in hundred of rupees) for each salesman in
each district would be as follows: (20) Job 1 2 3 4 5 6 7
Machin 3 1 1 6 1 1 9
Districts eA 2 5 0 1
A B C D E Machin 8 1 1 6 1 1 3
! 32 38 40 28 40 eB 0 0 2
Salesman 2 40 24 28 21 36
3 41 27 33 30 37 7. Use dominance principle to solve the game whose pay-off matrix is given
4 22 38 41 36 36 by: (20)
5 29 33 40 35 39
Find the assignment of salesmen to districts that would result in the maximum Y1 Y2 Y3 Y4 Y5
sales. X1 4 6 5 10 7
X2 6 7 4 8 9
X3 9 8 10 9 8

1223055-P-2-Q-7 -1- P.T.O.