No.
of Printed Pages : 3 MMPO-001
om
MANAGEMENT PROGRAMME (MP)
Term-End Examination
.c
December, 2022
ru
MMPO-001 : OPERATIONS RESEARCH
Time : 3 hours Maximum Marks : 100
u
Weightage :70%
tG
Note : (i) Attempt any five questions.
en
(ii) All questions carry equal marks. Each question
carries 20 marks.
m
1. What is Operations Research ? Describe the
ign
managerial applications of Operations Research
in decision-making.
ss
2. Explain the concept and computational steps of
the simplex method for solving linear
UA
programming problems. How would you identify
whether an optimal solution to a problem
obtained using the simplex algorithm is unique
NO
or not ?
IG
MMPO-001 1 P.T.O.
3. Determine the basic feasible solution to the
om
following transportation problem by using the
following :
(a) North-West Corner Rule
.c
(b) Vogel’s approximation method
ru
Distribution Centres
u
Sources D1 D2 D3 D4 Supply
tG
S1 2 3 11 7 6
S2 1 0 6 1 1
S3 5 8 15 9 10
en
Requirements 7 5 3 2
m
4. What do you mean by goal programming ? What
are the assumptions of goal programming ?
ign
Discuss the major differences between linear
programming and goal programming.
ss
5. In a game of matching coins with two players,
suppose A wins one unit of value when there are
UA
two tails and loses 1/2 unit of value when there is
one head and one tail. Determine the pay-off
NO
matrix, the best strategies for each player and
the value of the game to A.
IG
MMPO-001 2
6. A self-service store employs one cashier at its
counter. An average of nine customers arrive
om
every 5 minutes, while the cashier can serve
10 customers in 5 minutes. Assuming Poisson
distribution for arrival rate and exponential
.c
distribution for service rate, find :
(a) The average number of customers in the
ru
system.
u
(b) The average number of customers in a
queue or average queue length.
tG
(c) Average time a customer spends in the
system.
en
(d) Average time a customer waits before being
served.
m
7. Write short notes on any four of the following :
ign
(a) Cardinal Value and Ordinal Value
(b) Non-Linear Programming
ss
(c) Principle of Dominance
(d) Kendall’s Notation
UA
(e) Monte Carlo Simulation
NO
IG
MMPO-001 3 P.T.O.
