Documente Academic
Documente Profesional
Documente Cultură
Dear Students,
ASSIGNMENT
DRIVE
PROGRAM
SEMESTER
SUBJECT CODE
& NAME
BK ID
CREDITS
MARKS
FALL 2015
MBA/ MBADS/ MBAFLEX/ MBAHCSN3/ PGDBAN2
II
MB0048
OPERATIONS RESEARCH
B2068
4
60
.
Q.N
o
1
Questions
Mar
ks
Tota
l
1.25
8.75
Research
(1.25
10
mar
ks
for
eac
2
b. A paper mill produces two grades of paper viz., X and Y. Because of raw material
restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade
Y paper in a week. There are 160 production hours in a week. It requires 0.20 and 0.40
hours to produce a ton of grade X and Y papers. The mill earns a profit of Rs. 200 and Rs.
500 per ton of grade X and Y paper respectively. Formulate this as a Linear Programming
Problem.
A a. Explain the concept of linear programming
2
4
Programming Problem
b. Frame/formulate the LPP (Objective function & Constraints)
10
10
b. Find an optimal solution to an assignment problem with the following cost matrix:
M
1
M
2
A
J1
10
J2
9
J3
7
J4
8
M
a.List the steps in Hungarian method
10
problem
5 a. Explain Monte Carlo Simulation.
b. Hindustan Bakery is popular for its delicious fruit cakes. The table below shows the
daily
cakes.
0 the bakerys
15
25
35
45
50
Dailydemand for
Dema
Probabilit 0.01
0.15
0.2
0.5
0.12
0.02
y
Simulate the demand for cakes for 10 days using the following sequence of
random numbers:
22, 26, 48, 53, 93, 89, 42, 91, 25, 20
If 35 cakes are baked every day in Hindustan Bakery, determine the inventory stock.
In addition, estimate the daily average demand for cakes on the basis of simulated
data.
5
10
a. Explain what is Monte Carlo Simulation and list the steps of of
Monte Carlo Simulation
b. Solve/ Compute the solution to the problem
b.
*A-Answer
Note Please provide keywords, short answer, specific terms, specific examples and
marks break - up (wherever necessary)
Note Answer all questions. Kindly note that answers for 10 marks questions should be
approximately of 400 words. Each question is followed by evaluation scheme
Dear Students,
10