abm1110_2009_operations research,24-05-2014_may 2014

2
Course Code : ABM1110/ 2009 R-2009 Reg. No : Page 1 of 2 GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING (AUTONOMOUS) Madhurawada, Visakhapatnam Affiliated to JNT University – K, Kakinada B.Tech. VI-Semester Regular & Supplementary Examinations, May– 2014 Operations Research (Mechanical Engineering) Date : 24-05-2014 Time : 3 Hours Max. Marks : 60 1. Question No. 1 is Compulsory. 2. Answer any FOUR from questions 2 to 8. 3. All parts of a Question must be answered in one place to get valued. 1. Answer all the following questions: a) Differentiate between simplex maximization and simplex minimization in terms of condition for optimality. b) Differentiate between Unbalanced assignment problem and Unbalanced transportation problem. c) Define Traveling salesman problem. d) Define Dominance rules in game theory. e) List out assumptions in Sequencing. f) Define various costs in EOQ model. g) Classify Queue discipline. h) Define Dynamic Programming. 2 x 8 = 16 Marks 2. Solve the following LPP. Minimize Z = 10x 1 + 5x 2 + 4x 3 Subject to constraints 3x 1 + 2x 2 – 3x 3 3 4x 1 + 2x 3 10 x 1 , x 2 , x 3 0 11 Marks 3. Solve the following Transportation problem for optimum solution. To From D 1 D 2 D 3 SUPPLY F 1 4 8 8 56 F 2 16 24 16 82 F 3 8 16 24 77 DEMAND 72 102 41 11 Marks 4. Solve the following Assignment problem M/cs MEN M 1 M 2 M 3 M 4 M 5 A 16 18 20 14 10 B 10 16 18 20 14 C 14 10 16 18 20 D 20 16 14 12 10 11 Marks

Upload: manoj-gokikar

Post on 08-Jul-2016

212 views

Category:

Documents


0 download

DESCRIPTION

GVPE

TRANSCRIPT

Page 1: ABM1110_2009_Operations Research,24-05-2014_May 2014

Course Code : ABM1110/ 2009 R-2009 Reg. No :

Page 1 of 2

GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING (AUTONOMOUS)

Madhurawada, Visakhapatnam

Affiliated to JNT University – K, Kakinada B.Tech. VI-Semester Regular & Supplementary Examinations, May– 2014

Operations Research (Mechanical Engineering)

Date : 24-05-2014 Time : 3 Hours Max. Marks : 60

1. Question No. 1 is Compulsory.

2. Answer any FOUR from questions 2 to 8.

3. All parts of a Question must be answered in one place to get valued.

1. Answer all the following questions:

a) Differentiate between simplex maximization and simplex minimization in terms of condition

for optimality.

b) Differentiate between Unbalanced assignment problem and Unbalanced transportation

problem.

c) Define Traveling salesman problem.

d) Define Dominance rules in game theory.

e) List out assumptions in Sequencing.

f) Define various costs in EOQ model.

g) Classify Queue discipline.

h) Define Dynamic Programming.

2 x 8 =

16 Marks

2. Solve the following LPP.

Minimize Z = 10x1 + 5x2 + 4x3

Subject to constraints 3x1 + 2x2 – 3x3 ≥ 3

4x1 + 2x3 ≥ 10

x1, x2, x3 ≥ 0

11 Marks

3. Solve the following Transportation problem for optimum solution.

To

From

D1 D2 D3 SUPPLY

F1 4 8 8 56

F2 16 24 16 82

F3 8 16 24 77

DEMAND 72 102 41

11 Marks

4.

Solve the following Assignment problem

M/cs

MEN

M1 M2 M3 M4 M5

A 16 18 20 14 10

B 10 16 18 20 14

C 14 10 16 18 20

D 20 16 14 12 10

11 Marks

Page 2: ABM1110_2009_Operations Research,24-05-2014_May 2014

Course Code : ABM1110/ 2009 R-2009 Reg. No :

Page 2 of 2

5.

a) List out S.M.Johnsons rules in sequencing.

b) Solve the following scheduling problem.

Jobs

M/cs

J1 J2 J3 J4 J5 J6

MI 6 12 14 16 18 8

MII 8 10 10 14 10 12

MIII 10 7 12 10 12 9

5 Marks

6 Marks

6. a) Write short notes on EOQ and Total cost.

b) Given annual demand = 1060

Carrying cost = Rs. 16/ unit/ year

Ordering cost = Rs. 60/ order

Determine EOQ and total cost.

4 Marks

7 Marks

7. Solve the following game

B1 B2 B3 B4 B5

A1 60 40 90 30 40

A2 50 40 80 20 30

A3 40 30 70 15 25

A4 65 50 90 40 30

11 Marks

8. Given that the arrival rate is 30 customers/ hour and service rate is 40 customers/ hour.

Determine a) probability that there is no queue

b) Average number of customers waiting

c) Average waiting time of a customer.

11 Marks