Manonmaniam Sundaranar University (MSU) 2006 B.Sc Mathematics OPERATION RESEARCH - Question Paper

select the accurate ans. (10X1=10)

1. What is an unbounded solutions?
a. finite number of solutions
b. infinite number of solutions
c. feasible solution
d. infeasible solution.

2. There is a dual constraint for every -------
a. dual variable
b.primal variable
c.primal constraint
d. feasible solution.

3. A basic feasible solutions is optimum if
a.Zj-Cj<0 b. Zj-Cj>0 c. X1,X2,......Xn>0 d. X1,X2,.....<0.

4. Dual simplex method is applicable to the L.P.P having
a. an optimum solution b. an infeasible solution c. an optimum and feasible solution d. an optimum and feasible solution.

5. A transportation issue is stated to be balanced if
a. Total supply > Total demand b. Total supply < Total demand c. Total supply = Total demand=0 d.Total supply = Total demand.

6. The current basic feasible solution of the transportation issue is optimal if
a. 1 Zij-Cij<0 b. all Zij-Cij<0 c. oneZij-Cij>0 d.all Zij-Cij>0

7. In the optimum solution of the assignment problem, a provided row or column of the cost matrix have ----
a. no assignment b. <0assignment c.>2 assignment d. 1 assignment.

8.If Cij > 0 such that minimum Cij =0 then xij provides
a. optimum solution b. feasible solution c. infeasible solution d. unbounded solution.

9. The sequence of jobs and the order of completion of jobs are
a. dependent b. independent c. minimum d. maximum.

10. In graph method the diagonal line segment indicates that
a. no job is under process b.first job is under process c. 2nd job is under process d.both jobs are under process

ans All ques. (5x6=30 marks)

11. a. Write the standard form of the linear programming issue.
b.solve graphically: Max Z=3X1+2x2 subject to 2x1+x2<40 x1+x2<24 2x1+3x2<60 x1+x2>0.

12.a. Use penalty method to solve Max Z=3x1+2x2 subject to 2x1+x2 <2 3x1+4x2>12 x1,x2>0

b. Prove that the dual of the dual us primal.

13. a. find an initial basic feasible solution to the folloeing transportaion issue using the matrix minima method . D1 D2 D3 D4

01 one two three four 6

02 four three two 0 8

03 0 two two one 10

four six eight 6

b. discuss Vogels approximation method.

14.a. Write Hungarian assignment algorithm.

b. Solve the subsequent assignment problem:

Earning:   Approval pending.