Bharathidasan University 2000 M.C.A., OPERATION RESEARCH TECHNIQUES - Question Paper

M.C.A., 2nd Year
OPERATION RESEARCH TECHNIQUES
MAY 2000

Time: 3 hours
Maximum: 75 marks

PART A - (5 x five = 25 marks)

ans ALL ques..
All ques. carry equal marks.

1. (a) Illustrate a formulation of a LP for your own issue.

Or

(b) Compare the Big-M method with 2 phase method.

2. (a) explain a few special cases of LPP.

Or

(b) Write down the advantages of Linear programming.

3. (a) What is interger programming problem?

Or

(b) describe degeneracy.

4. (a) How do you estimate the activity time?

Or

(b) what are the steps involved in determination of Critical Path.

5. (a) define the single server with finite queue length setup.

Or

(b) How do you classify the stochastic processes? discuss.

PART B - (5 x 10 = 50 marks)

ans any 5 ques..
All ques. carry equal marks.

6. Use simplex method to solve the provided LPP :
Maximize Z = x1 + 2x2 + 2x3
Subject to 5x1 + 2x2 + 3x3 £ 15
x1 + 4x2 + 2x3 £ 12
2x1 + x3 £ eight where x1, x2, x3 ³ 0.

7. Solve the subsequent using Dual simplex:
Maximize Z = 30x1 + 40x2
Subject to 6x1 + 12x2 £ 120
8x1 + 5x2 ³ 60
3x1 + 4x2 = 50 where x1,x2 ³ 0

8. Solve the provided transportation issue to minimize the cost:
Warehouses Factories Capacity one two 3
A six 11 eight 100
B seven three five 200
C five four three 450
D four five six 400
E eight four five 200
F six three eight 350
G seven two four 300
Factory production 700 400 1000


9. A shop has 6 machines. 2 jobs must be processed by every of them. obtain the order should jobs be done on every of the machines to minimize the finishing time.
Order one two three four five six
Job I A-20 C-10 D-10 B-30 E-25 F-15
Job II A-10 C-30 B-15 D-10 F-15 E-20

10. Solve the subsequent IPP using BIP method
Minimize Z= 5x1 +6x1 +7x3 +8x4 +9x5
3x1 - 3x2 + x3 + x4 - 2x5 ³ two
x1 +3x2 - x3 - 2x4 +x5 ³ 0
-x1 -x2 + 3x3 +x4 + x5 ³ 1.
and xj is integer j = 1, ... 5.

11. what are the procedure to solve the deterministic issues through dynamic programming approach.

12. provide the transition matrices of a Markov chain, determine the classes of the Markov chain( )

13. discuss the special cases of birth and death model.

Earning:   Approval pending.