MTH601 Final Term Past Paper Spring 2006

MTH601 OperationsResearch · Final Term Examination - February 2005 · Time Allowed: 150 Minutes · Instructions

2. D one. o not ask any questions about the contents of this examination from any

3. In Q3 you can either draw the network diagram or simply write the asked terms for each activity in the exam software, whichever you think is easy for you. But remember that you have to show your work on exam application correspond to each question.

tions: 8

Total Ques

Q1. Marks : 4

Define the followings.

(a) Impossible Assignmen (b) Unbounded Solution. t

Q2. Marks : 10

Consider the problem max imize z = x + 5x + 3x

Subject to x + 2x + x =

2x1x−

x , x , x ≥ The variable x3 plays the role of a slack. Use big M-method to solve the problem.

Q3. Marks : 4

How the problem of the degeneracy arises in a transportation problem?

Q4. Marks : 4

Define the followings in Queuing Theory.

a. Customer b. Server c. Priority

Q5. Marks : 4

What are the variants of the simplex method? Write few lines about the followings.

(a) Unbounded solution. (b) Unrestricted variables.

Q6. Marks : 10

Five different machines can process any of the five required jobs with different profits resulting from each assignment.

Find the maximum profit possible through optimum assignments.