ASSIGNMENT Jan-2019
MS-51 Operations Research
Note :
Attempt all the questions and submit this assignment on or before 30th April, 2019 to
the Coordinator of your study center.
1. Solve the following problem through SIMPLEX
method.
Minimize Z = -3x1+x2+x3
Subject to
x1-2x2+x3≤11
-4x1+x2+2x3≥3
-2x1 +x3=1
x1≥0, x2≥0 and x3≥0
2. A
refueling station is served by a single pump machine for providing service to
the petrol vehicles. The arrival process has shown that the distribution of
times between arrivals is negative exponential with a mean of 10 minutes.
Similarly, service times were found to be adequately described by a negative
exponential distribution with a mean of 6 minutes. Waiting space is unlimited.
Determine:
(i) Probability that the customer has to wait.
(ii) Mean number of customer in the system.
(iii) Percentage utilization of the service
station.
(iv) Steady-state probability of having four
customers in the system.
3. “
In a goal programming, we attempt to „satisfy‟ or come as close as possible to satisfying the
various goals,” Discuss.
4. What
is simulation? Describe the simulation process. State the major two reasons for
using simulation to solve a problem. What are the advantages and limitations of
simulation?
5. Write
short notes on any five of the following:
(a) GOAL Programming
(b) GOMORY‟s cutting plane Algorithm
(c) Selective Inventory Control
(d) Pure and Mixed Strategy
(e) Sensitivity Analysis
(f) Monte Carlo Simulation
Get Solved Assignment Jan-2019 with pervious solved
question paper
“ Why do
you want to pay only for assignment answers, when we can provide you assignment
answers with last 5 years university solved question papers in printed book
format at your door step.”
Call 9825183881
No comments:
Post a Comment