Question 1)a) Explain the role of operations research in decision making?
b) Write down the limitations of linear programming?
c) Why do we add slack and subtract surplus variables for solving problems by simplex method?
d) Obtain the dual of linear program Max.
Z = 3x1 + 5x2 + 7x3
Subject to: x1 +x2+ 3x3 ≤ 10
4x1- x2 +2x3 ≥ 15
where x1, x2 ≥ 0 and x3 is unrestricted.
e) How does the assignment model form the special case of transportation model?
f) What do you mean by the term Saddle point'?
g) Write down the typical features of the problems, which are best suited to be solved by Dynamic programming techniques?
h) Write down the difference between CpM and pERT?
i) What is degeneracy in transportation problems? When does it creep into the solution?
j) What will happen to gain of a player if he plays mixed strategy in a game where saddle point exists.