Professional Documents
Culture Documents
(i) Attempt any four questions from Part-ll. All questions carry equal marks.
Part-
01 () Define Operations Research. 10x2
(i) What is shadow price in LPP?
(ii) What is duality in LPP?
(iv) What is degeneracy in transportation problem?
(v) Define EVPI. How is it calculated?
(vi) What is a steady state system?
(vin) Differentiate between balking and reneging customer behaviour?
(vii) What is Laplace criterion in decision analysis?
(ix) Distinguish between PERT and CPM.
(x)What do you understand by crashing of network?
Part-
Q2 What are the phases of operations research project? Explain in detail. 10
Q3 A company earns profit of Rs. 25.00 per unit on Product A and Rs. 40.00 per unit on 10
product B. The products are manufactured using leather, wood and glue in the amount
given below
Resources required for one unit
Product Leather Wood Glue
(in Kg) (in Sq. Mts.) (in Lts.)
A 0.50 4 0.2
B 0.25 0.2
Available resources include 2200 kgs of leather, 28000 sq. meters of wood and 1400
litres of glue.
(a) Formulate the above problem as LPP.
(b) Solve by simplex method and find optimal solution.
(c) Which resources are fully consumed? How much of each resource remains
unutilized?
(d) What are the shadow prices of resources?
10 10
04 Arrivals at telephone booth are considered to be Poisson with an averaened to be
assud
min. between one arrival and the next. The length of phone call is
distributed exponentially with mean 3 min.
(a) What is the probability that a person arriving at the booth will have to wait?
(b) What is the average length of the queue that forms from time to time?
Q5 A manufacturer wants to ship 22 loads of product as shown below. The matrix gives 10
the kilometers from source to destinations
Destinations
Supply
D D2 D3 D D
S 5 8 6 3 8
Source 7 7 6 5
S2
S3 8 6 6
Demand 5 4 8
cost is Rs. 10 per load per km. What shipping schedule should be used to
Shipping
minimize total transportation cost?
Q6 A project consists of certain activities whose time required for each activity is given :n
the following table.
Activity 1-2 1-4 1-7 2-3 3-6 4-5 4-8 5-6 6-9 7-9 8-9
ime 2 21415 8 4 3 3 5
(a) Draw network diagram for the project.
(b) Find the critica! path and the project completion time.
(c) Calculate the earliest start and finish time, latest start and finish time for each
activity.
(d) Calculate total float, free float and independent float of each activity
07 An automobile company manufactures around 250 bikes. The daily production varies
from 246 to 254 depending upon the availability of raw materials and other working
conditions:
Production/day: 246 247 248 249 250 251 252 253 254
0.05 0.10 0.13 0.15 0.12 0.08 0.20 0.10 0.07
Probability
The finished bikes are transported in a specially arranged lorry accommodating 250
bikes. If the bikes are produced more than 250 then the number of bikes whichare
waiting for dispatch are sent same day by hiring special suface cargo service usi0
60,
following random numbers: 79, 80, 75, 74, 63, 42, 17, 25, 9, 11, 64, 67, 68,
simulate the process to find out
What will be the average number of bikes waiting in the factory to be sent
(a)
same day by hiring special surface cargo service?
b) What will be the average number of empty space on the lorry?
Roll No. °°°
Total Pages: 5
240304
December, 2019
M.Sc. (Mathematics) III SEMESTER
-
Instructions
marks
. his compulsory to answerall the questions (1.5
each) of Part-A in short.
Answer any four questions from Part-B
in detail.
2.
be attempted
3. Different sub-parts ofa question are to
adjacent to each other
PART A
240304/80/111/296 PTO
17/12
Drok
(e) What is degeneracy
in transportation
problem?
How is it resolved? (1.5)
Define assignment problem and
give its1mathematica
(
formulation. (1.5)
2x2 games
(g) algebraic method for solving
Discuss the
management? (1.5)
PART B
Max z 2x +2
Subject to the constraints:
+212 S 10, x +2S6, X1 -X2S2,
-2x 1 and x, 2 2 0. (7)
(b) Solve the following LPP by Big-M method:
Max z 3x, - X2
Subject to the constraints:
240304/80/111/296 2
3.
3. (a) Solve the following LPP using Simplex Method
Max z= 30x, + 23x, +
29x
Subjectto
6x+Sx, +3x, s 26
4x+2, +Sx 7
3 2 0. (7)
b) Solve the following LPPusing Dual Simplex Method
Max z2 -¥3
Subjectto
t-325
- 2x +
4x 28
(8)
P 4 5 9 40
8 5 6 7 8 30
6 8 9 5 20
10
F 5 7 7 8 6
Requirements| 30 30 15 20 5
(15)
240304/80/111/296 3 PTO.
5. (a) Find the optimal solution (cost minimizing) of the
following assignment problem:
Jobs II IV V
Machines U
A 11 10 18 5 9
B 14 13 12 19 6
C 5 3 4 2
D 15 18 17 9 12
E10119 19 6 14
(7)
b) Prove that if an LPP has an optimal feasible solution,
its dual also has optimal feasible solution. (8)
240304/80/111/296 4
7. (a) Explain the principle
of dominance in
game theory
and solve the
following game:
Player B B
BB, B B
Player A
A 10 4 2 9
A2 7 6 57|8
A3 3 4 9
A4 6
33 2
(7)
b) Solve the following game graphically:
Player B B,B,B B,B B
Player A
-6 -8
A 848
A2 -7-5-1 -3
4
(8)
240304/80/111/296 5