Page copy protected against web site content infringement by Copyscape
MS-51 Operations Research

Sponsors

Sponsors

Sponsors

Sponsors

Partners

Copyscape

Page copy protected against web site content infringement by Copyscape

Sponsors

MS-51 Operations Research

Note: Please attempt all the questions and send it to the Coordinator of the study

center you are attached with

 Find out the optimal solution of the following LP problem through SIMPLEX method.

Maximise Z = 20 x 1 + 6 x 2 + 8 x 3

Subject to

8 x 1 + 2 x 2 + 3 x 3 200

4 x 1 + 3 x 2 150

2 x 1 + x 3 50

x 1 , x 2 and x 3 > 0

Write dual of the problem given in Q.1. Explain the significance of dual variable in any LP problem.

 

  • a) Explain the difference between pure strategy and mixed strategy.

b) How the concept of dominance is used in simplifying the solution of a

rectangular game?

a) Discuss the parameters of Queing problem.

b) Telephone department will install a second booth when convinced that an

arrival would expect to waiting for at least 3 minutes to get his chance. By how

much should be the flow of arrivals in order to justify a second booth. Length

of phone call average is 3 min. Assume arrival and servicing rate as Poisson.

Write short notes on the following

    • Integer Programming
    • Dynamic Programming
    • Monte Carlo Simulation