**CS51: Operation Research** Year: 1998 TEE: December Time 2 Full Marks 75 Note: There are 6 questions in this paper. Question no. 1 is compulsory and carries 35 marks. From the remaining questions, attempt any two. Each of these carries 20 marks.
Q.1(a): Define the following terms very briefly, typically within one paragraph. - Pay-off matrix for a game
- EOQ in the context of inventory
- Constraints in an L.P. problem
- The value of a game
- Prior probability
| **Q.1(b):** If a transportation problem has p factories and q retail shops, what is the number of variables and what is the number of constraints?: [10]
**Q.1(c):** What is convex set? Illustrate with examples.: [10]
**Q.2(a):** List the factors that constitutes the basic elements of a queuing model. What are the assumptions made in M/M/I? What conclusions do these lead to about the average queue length?: [0]
home || Next >> |