Periyar University 2008-3rd Sem B.B.A -INTRODUCTION TO OPERATION RESEARCH-I -ester - Question Paper
( 7 pages) S.No. 2825
(For the candidates admitted from 2006--2007 onwards)
06 IJBA 05
B.B.A. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2008..
Third Semester
INTRODUCTION TO OPERATIONS RESE ARCH I
Time : Three hours Maximum : 100 marks
PART A (10 x 2 = 20 marks)
Answer ALL questions.
JlDefine the term Operations Research.
2./''"What is Iconic model?
What do you mean by Linear Programming?
Define Simplex Method.
&rWhat is degeneracy in transportation problem?
What is basic feasible solution to a transportation problenv?
Define assignment model.
8. What is unbalanced assignment problem?
What are the decision making environments?
10. What do you mean by Decision Tree?
PART B (5 x 4 = 20 marks)
Answer ALL questions.
11. (aiWhat are the phases of Operation Research?
Or
(b) What is characteristics of a good model?
12. (a) State the procedure for mathematical formation of linear programming problem.
Or
(1hy' Solve graphically :
Maximize Z = 30 t 40x2
subject to : 60*j + 120*2 12,000 8*! + 5;c2 600 3*! + 4*2 < 500 and xly x2 > 0.
{
13. (a) Explain the methods used to find a basic feasible solution to the transportation problem.
Or
Qfl Obtain an initial basic feasible solution to thiollowing T.P. using the least cost method :
Destination
|
D1 |
D2 |
Da |
Da |
Supply | |
|
01 |
1 |
2 |
3 |
4 |
6 |
|
Origin O2 |
4 |
3 |
2 |
0 |
8 |
|
Os |
0 |
2 |
2 |
1 |
10 |
|
Demand |
4 |
6 |
8 |
6 |
14. (a) Explain the steps in Hungarian Assignment Method.
/ Or
(hySolve the following assignment problem :
Machine
/
/
S.No. 2825
| |||||||||||||||||||||||||
|
3 |
Or
(b)x"A decision problem has been expressed in the following payoff table :
\ Outcome
|
I |
II |
III | |
|
A |
10 |
20 |
26 |
|
Action B |
30 |
30 |
60 |
|
C |
40 |
30 |
20 |
(i) What is the minimum payoff action?
(ii) What is the minimum opportunity loss
function?
PART C (5 x 12 = 60 marks)
Answer ALL questions.
16. (a) Explain the scope of Operations Research in Management.
Or
(b) Discuss various classification scheme? of models.
[P.T.O.]
4
17. (a) Sojve under simplex method :
/ Miaximize : Z = 4x, + 10x9
/
subjet to: 2x1 +% <10 2+5*2 <20
2xx+Sx218 and xXix2 0.
Or
(b) Solve under simplex method :
Minimize Z = 2Y1 + SY2
subject to: Y, + Y2 > 5 Yx + 2Y2 > 6 andYYO.
|
18. |  |
Sqfrve the following transportation problem :
Dealer D2 D3
|
Di Da Capacity | ||||||||||||||||||||||||||||
|
r
(b) Solve the following transportation problem
for maximum profit.
Market (per unit profit)
A B C D Availability
|
X |
12 |
18 |
6 |
25 |
|
Warehouse Y |
8 |
7 |
10 |
18 |
|
Z |
14 |
3 |
11 |
20 |
Requirement 180 320 100 400
19. (a) ,-iTind an optimal solution to an assignment
problem'witjn following cost matrix :
| ||||||||||||||||||||
|
Or |
(b) Solve the following assignment problem to find the maximum total expected sales.
Area
| |||||||||||||||||||||||||
|
6 S.No. 2825 |
f
20. (a) A motor-parts dealer finds that the cost of a particular item in stock for a week is Rs. 20 and the cost of a unit shortage is Rs. 50. The probability distribution of weekly sales (in 000 items) is as follows :
Weekly sales (in 000): 0 1 2 3 4 5 6 Probability : 0.10 0.10 0.20 0.20 0.20 0.15 0.15
How many units per week should the dealer order? Also find EUPI.
Or
(b) A newspaper boy has the following probabilities of selling a magazine :
No. of copies sold : 10 11 12 13 14 Probability : 0.10 0.15 0.20 0.25 0.30
Cost of copy is 3 paise and sale price is 50 paise. He cannot return unsold copies. How many copies should be order?
|
Attachment: |
| Earning: Approval pending. |
