University : University of Madras
Degree : B.B.A
Department : Business Administration
Subject :Introduction To Operation Research
Document type : Question Paper
Website : ideunom.ac.in
Download Previous/ Old Question Paper :
May 2013 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6784-._MAY2013_uid5221%20PXN.pdf
December 2012 :https://www.pdfquestion.in/uploads/ideunom.ac.in/6784-._DEC12_pid102%20PXN.pdf
IDEUNOM Operation Research Question Paper
U/ID 5221/PXN
Time : Three hours
Maximum : 100 marks
Related / Similar Question Paper :
University of Madras BBA Production & Materials Management Question Paper
October 2011
SECTION A — (10 ´ 3 = 30 marks)
Answer ALL questions.
All questions carry equal marks.
1. (a) State two definitions of operation research.
(b) What is a linear programming problem?
(c) When is an initial solution of a transportation problem said to degenerate?
(d) What do you mean by assignment problem?
(e) Define event and activity.
(g) Define a queue discipline.
(h) What is Birth-Death process in queueing theory?
(i) Give the meaning of maximin-minimax principle.
(j) What do you mean by two-person zero sum game?
SECTION B — (5 ´ 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
2. What are the essential characteristics of operation research?
3. Solve the following LPP by using graphical method
4. Find the initial basic feasible solution for the following transportation
D1 D2 D3 D4 Availability
O1 11 13 17 14 250
O2 16 18 14 10 300
O3 21 24 13 10 400
Requirements 200 225 275 250
5. Draw the network for relation given below.
Activity : A B C D E F G H I
Predecessor : – A A – D B, C, E F D G, H
6. Explain customer’s behaviour with one example.
7. Explain :
(a) Hurwich criterion
(b) Minimax regret criterion.
8. Solve the following 2 * 2 game.
SECTION C — (2 ´ 20 = 40 marks)
Answer BOTH questions.
All questions carry equal marks.
9. (a) Solve the following LPP by using Simplex method
Or
(b) Explain the different types of models used in operation research.
10. (a) Solve the following assignment problem.
Machines
I 13 8 16 18 19
II 9 15 24 9 12
III 12 9 4 4 4
IV 6 12 10 8 13
V 15 17 18 12 20
Or
(b) Solve the following 6 * 2 game graphically.
October2012
U/ID 5221/PXN
Time : Three hours
Maximum : 100 marks
SECTION A — (10 ´ 3 = 30 marks)
Answer ALL questions.
All questions carry equal marks.
1. (a) Write the standard form of a linear programming problem.
(b) What are the slack and surplus variables?
(c) Define the optimal solution to a transportation problem.
(d) What do you mean by an unbalanced assignment problem?
(e) Define free float and total float.
(f) Mention any two uses of PERT.
(g) Define a queue.
(h) Mention the customer’s behaviour with one example.
(i) State Baye’s theorem.
(j) Distinguish between pure and mixed strategies.
SECTION B : (5 ´ 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
2. Explain briefly the general methods for solving OR models.
3. Solve the following LPP by graphic method.
Minimize : 1 2 z = 3x + 2x
Subject to : , 0 4 12 6 5 10 1 2
4. Find the initial basic feasible solution for the following transportation problem by least cost method.
To Supply From 1 2 1 4 30 3 3 2 1 50 4 2 5 9 20
Demand 20 40 30 10
5. Draw a network for the relation given below :
Activity : A B C D E
Immediate predecessor : – – A, B B B
Activity : F G H I
Immediate predecessor : A, B F,D F,D C,G
6. A car park contains 5 cars. The arrival of cars is poisson at a mean rate of 10 per hour. The length of time each car spends in the car park is exponential distribution with mean of 5 hours. How many cars are in the car park on an average?
8. What are the main characteristics of game theory?
SECTION C : (2 ´ 20 = 40 marks)
Answer BOTH questions.
All questions carry equal marks.
9. (a) Use simplex method to solve the following linear programming problem.
Maximize : 1 2 z = 5x + 3x
Subject to : , 0 5 2 10 3 5 15
Or
(b) Three are five jobs and five machines processing costs are given in the following table. Solve the assignment problem.
M1 M2 M3 M4 M5
J1 16 13 17 19 20
J2 14 12 13 16 17
J3 14 11 12 17 18
J4 5 5 8 8 11
J5 5 3 8 8 10
10. (a) Compute the earliest start, earliest finish, latest start and latest finish of each activity of the project given below.
Activity : 0-1 1-2 1-3 2-4
Duration : 2 8 10 6
Activity : 2-5 3-4 3-6 4-7
Duration : 3 3 7 5
Activity : 5-7 6-7
Duration : 2 8
Or
(b) (i) Discuss the elements of queueing system and its advantages.
(ii) Solve the following 2 ´ 5 game graphically.
Player B 6 5 1 4 0
Player A 2 –2 3 7 6
View Comments (1)
Will you upload this march operation research paper?