Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
ASSIGNMENT
DRIVE SUMMER
2016
PROGRAM MBA
SEMESTER II
SUBJECT CODE & NAME MB0048
OPERATIONS RESEARCH
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.
Question1. Describe the process and principles of
modelling in detail.
Answer1. Process
models are processes of the same nature that are classified together into a
model. Thus, a process model is a description of a process at the type level.
Since the process model is at the type level, a process is an instantiation of
it. The same process model is used repeatedly for the development of many
applications and thus, has many instantiations. One possible use of a
Question2. a.
Discuss any four applications of linear programming.
Answer
2a. Four
b.
An organisation produces X1 and X2 units of products R and S, respectively. In
this case, the objective function and constraints are expressed as follows:
Maximise Z = 60X1 + 120X2
Subject to, 3X1 + 6X2 ≤ 240
Raw material constraint
2X1 +
4X2 ≤
800 Labour hours constraint
X1,
X2 ≥ 0
Non-negativity condition
Use
graphical method to determine how many units of products R and S the
organisation should produce to maximise its profits.
Answer 2(b) - Here,
We
have to
Question3.a. Explain the concept of Trans-shipment.
Answer3(a). Transhipment
is the act of off-loading a container from one ship and loading it onto another
ship. In any service operated by any line there are practical restrictions in
terms of coverage of ports.. There is no shipping line that can cover all ports
around the world on a single
b.
Solve the following transportation problem using North-west corner method &
Matrix minimum method.
Answer3(b).
Question4. The processing time of four jobs and five
machines (in hours, when passing is not allowed) is given in following table
a. Find an optimal sequence for the above sequencing
problem.
b. Calculate minimum elapsed time & idle time
for machines A, B, C, D & E.
Answer4.
Question5.
Define following criteria’s used for decision making under Uncertainty
a.
Optimism (maximax or minimin) criterion
Answer
5(a).
Maximax
(Optimist)
The maximax
looks
b.
Pessimism (maximin or minimax) criterion
Answer5(b).
Maximin
(Pessimist)
The maximin
person looks at the worst that could happen under each action and then choose
the
c.
Equal probabilities (Laplace) criterion
Answer5(c).
Laplace
criterion is also called as law of equal probabilities criterion or criterion
of rationality, since probability of states of nature are not known it is
assumed that all states of nature will
d.
Coefficient of optimism (Hurwicz) criterion
Answer5(d).
A compromise
between the maximax and maximin criteria. The decision maker is neither totally
optimistic (as the maximax criterion assumes) nor totally pessimistic (as the
maximin
e.
Regret (salvage) criterion
Answer5(e).
The
minimization of regret that is highest when one decision has been made instead
of
Question6.
Explain the following:
a.
Economic Order Quantity(EOQ)
Answer6(a).
Economic order
quantity (EOQ) is an equation for inventory that determines the ideal order
quantity a company should purchase for its inventory given a set cost of
production, demand rate
b. PERT and CPM
Answer6(b).
PERT stands for
Program Evaluation Review Technique, a methodology developed by the U.S. Navy
in the 1950s to manage the Polaris submarine missile program. A similar
c. Applications of queuing models
Answer6(c).
Queueing Theory
has a wide range of applications, and this section is designed to give an
illustration of some of these. It has
been divided into 3 main sections, Traffic Flow,
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs 125/subject
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment