Andhra University 2005 B.Tech Information Technology - Operations Research - Question Paper

MODEL PAPER

B. Tech (IT) Degree exam

Third Year - 2nd Semester

OPERATIONS RESEARCH

Time: three hrs
Max Marks: 70

First ques. is Compulsory

ans any 4 from the remaining ques.

All ques. carry equal marks

ans all parts of any ques. at 1 place

1. Write short notes on the following:
a) Min-Max Method
b) Graphical Method for solving a Linear Programming issue.
c) Zero sum Game.
d) discuss the Duality in linear programming
e) Economic order volume (EOQ)
f) discuss North West corner rule.
g) State the Assignment issue.

2. a) discuss the characteristics of LP model.

b) Solve the subsequent LP issue by using Simplex method:
Minimize : z = 4x1 + 4x2 - x3
Subject to 2x1 + x2 = 10
-3x1+2x2 = 6
x1+x2 = 0
x1, x2 = 0

Solve using the dual complex method.

4. a) discuss the Transportation and Transhipment issues.
b) provided the subsequent Transportation problem:

To A B C D Supply
From
1 five 12 seven 10 50
2 four six seven six 50
3 two eight five three 60
Demand 40 20 30 70

obtain the initial solution by VAM method and optimum solution by MODI method.

5. a) discuss the Travelling Salesman issue

b) A dispatcher presently has 6 taxicabs at various locations and 5 customers who have call for service. The mileage from every taxi’s current location to every curstomer is

Customer one two three four five
Cab
A seven two four 10 seven
B five one five six 6
C eight seven six five 5
D two five two four five
E three 3 five eight four
F six two four three four

Determine the optional assignment that will minimize the total mileage.

6. a) discuss the Critical Path method.
b) A project being planned involved the subsequent activities:

Activity Predecessor Duration
A - 14
B A 21
C A 50
D B 14
E C,D 30
F E 10

Construct the network.
Determine expected project completion time.
Determine free slack and total slack.

7. a) discuss the Graphical Method for solving a Game.

b) obtain the Optimal solution for the subsequent game using Graphical method:

Player B
1 two three four 5
Player A four two five -6 6
7 -9 seven four 8
8. a) discuss the Integer Programming issue.

b) discuss the Branch and Bound Technique for solving an Integer Programming issue

Earning:   Approval pending.