UNIVERSITY OF COLOMBO, SRI LANKA UNIVERSITY OF COLOMBO SCHOOL OF COMPUTING

DEGREE OF BACHELOR OF INFORMATION TECHNOLOGY (EXTERNAL) nd Academic Year 2006/2007 - 2 Year Examination Semester 3

IT3302 Operational Research

PART 1 - Multiple Choice Question Paper 18th March 2007 (ONE AND A HALF HOURS)

Important Instructions :
The duration of the paper is 1 (one and a half) hours. The medium of instruction and questions is English. The paper has 30 questions and 08 pages. All questions are of the MCQ (Multiple Choice Questions) type. All questions should be answered. Each question will have 5 (five) choices with one or more correct answers. All questions will carry equal marks. There will be a penalty for incorrect responses to discourage guessing. The mark given for a question will vary from 1 (All the incorrect choices are marked & no correct choices are marked) to +1 (All the correct choices are marked & no incorrect choices are marked). Answers should be marked on the special answer sheet provided. Note that questions appear on both sides of the paper. If a page is not printed, please inform the supervisor immediately. Mark the correct choices on the question paper first and then transfer them to the given answer sheet which will be machine marked. Please completely read and follow the instructions given on the other side of the answer sheet before you shade your correct choices. Non-programmable Calculators may be used.

1) Which of the following is/are true? (a) Operational research techniques were applied even during World War 2. (b) It is not possible to simultaneously maximize all the criteria for some management information system. (c) Operational Research techniques are of Multi disciplinary nature. (d) In all Operational Research applications, optimal solutions can be obtained. (e) Probability distributions are used in some of the areas in Operational Research Consider the following problem and answer questions (2), (3) and (4). Minimize Z== 5X1 +4 X2 , subject to 3X1 + 5 X2 15, X1+ X2 5, X1, X2 0. 2) Which of the following (X1, X2) are feasible solutions (a) (5,0) (d) (0,5) 3) Which of the following is/are true? (a) (b) (c) (d) (e) The feasible region of the problem is unbounded. The feasible region of the problem is bounded. There is no feasible region. The feasible region of the problem is a straight line. The feasible region of the problem is a single point. of the problem? (c) (0,3)

(b) (5,5) (e) (3,0)

4) Which of the following is/are true? (a) (b) (c) (d) (e) There is no optimal value for the objective function. The optimal value of the objective function is 15. The optimal value of the objective function is 12. The optimal value of the objective function is 25. The optimal value of the objective function is 20.

Answer questions (5) and (6) by using the tableau of a profit maximization problem represented below in the usual notation. (Xi denotes the number of units produced for product i=1, 2, 3 and Sis are the slack variables corresponding to the three resources R1, R2 and R3.) Initial X3 -10 1 0 2 tableau S1 S2 0 0 1 0 0 1 0 0

Z 1 0 0 0

X1 -10 1 5 3

X2 -16 2 4 0

S3 0 0 0 1

r.h.s. 0 30 40 90

5) Which of the following statements is/are true? (a) (b) (c) (d) (e) It is most profitable to select product 2. It is most profitable to select either the product 1 or the product 3. Product 2 can be produced even if resource 3 is not available. Maximum possible number of units of product 2 that can be produced is 15. r.h.s. contains the maximum availabilities of the resources.

6) Which of the following statements is/are true? (a) (b) (c) (d) (e) The initial solution of this problem is X1 =0, X2 =0, X3=0. The initial solution of this problem is X1 =30, X2 =40, X3=90 Unit profit contributions of X1 =10, X2 =16, X3=10. At the initial tableau, S1 =30, S2 =40, S3 =90. At the initial tableau, S1 =0, S2 =40, S3 =0.

Answer questions (7), (8), (9) and (10) using the initial tableau and the final tableau of the profit maximization problem given below. (Xi denotes the number of units produced for product i=1,2,3.) Initial tableau X3 S1 S2 -6 0 0 1 1 0 0 0 1 2 0 0 Final tableau 0 1 0 1 0 0 0 0 0 -2 1

Z 1 0 0 0 1 0 0 0

X1 -8 1 1 3 3/2 -1/4 2

X2 -2 2 4 0 0 0 1 0

S3 0 0 0 1 5/2 -1/4 1

r.h.s. 0 40 40 60 190 30 5 20

7) Which of the following statements is/are true? (a) (b) (c) (d) (e) The optimum values of the dual variables are 30, 5 and 20 respectively. The optimum values of the dual variables are 1, 0, 5/2 respectively. The optimum values of the dual variables are 1/2, 0 and 0 respectively. There is a surplus of in one dual constraint. The optimum profit is 190.

8) If the profit contribution of product 1 is changed from 8 to 8 + , the possible value(s) of (8 + ) which would not affect the current optimal solution is/are (a) 9 (d) 8.75 (b) 4 (e) 7 (c) 8.25

9) If the amount of resource 2 is changed by an amount , the possible value(s) of () which would not affect the current optimal solution is/are (a) 40 (d) -25 (b) 20 (e) -40 (c) -10

10) If the amount of resource 3 is changed by an amount , the possible value(s) of () which would not affect the current optimal solution is/are (a) -30 (d) 10 (b) -25 (e) 30 (c) -10

11) Degeneracy in Transportation problems occur when (a) at optimality, the total cost is 0. (b) in finding an initial solution, a row and a column requirement are simultaneously satisfied. (c) there are two or more filled cells with the same smallest negative value in a closed path for an incoming basic variable. (d) total supply is greater than total demand. (e) total demand is greater than the total supply. Answer questions (12) and (13) by considering the following transportation schedule where unit costs of transportation are given in the top left corner of each cell. Destination Origin F1 Origin F2 Origin F3 Demand S1 10 5 4 100 S2 15 7 9 150 S3 20 6 10 150 S4 14 6 15 150 Availability 200 150 200

12) After applying the North West corner method to the above problem, the cell evaluator (C21) for route corresponding to F2, S1 is (a) 5 (d) 7 (b) 13 (e) -3 (c) 0

13) When applying Vogels approximation method, the penalties for the F1,F2 and F3 are respectively (a) 10,5 and 4 (d) 4, 1 and 5 (b) 0, 0 and 0 (e) 200, 150 and 200 (c) 5, 2 and 5

14) Consider the following assignment problem where three workers W1, W2 and W3 are assigned to 3 jobs J1, J2 and J3. Their estimated costs for each job are given in each cell. W1 5 7 11 W2 10 12 10 W3 8 10 9

J1 J2 J3 The best feasible assignment(s) is/are (a) x x x (d) x x x

(b) x x x (e) x x x

(c) x x x

15) In the shortest path algorithm, the number placed above each node represents (a) (b) (c) (d) (e) the shortest distance from the origin to that node. the shortest distance from that node to the closest of its immediate predecessors. the shortest distance from the destination to that node. the length of the most direct route from the origin to that node. the longest path from the destination to that node.

Use the following network to answer questions 16 and 17.

16) Total length of the minimum spanning tree is (a) 21. (d) 25. (b) 28. (e) 30. (c) 19.

17) Shortest path from city A to cities E and F respectively are (a) 4 and 13. (d) 8 and 15. (b) 4 and 11. (e) 9 and 10. (c) 10 and 12.

18) Consider the following three figures.

(i)
1 2 1

(ii)
2 5 1

(iii)
2 5

Which of the following is/are true regarding the above figures? (a) (i),(ii),(iii) are networks. (c) (ii) is a spanning tree (e) (ii) is a connected network. (b) (iii) is a spanning tree. (d) (i) is a tree

19) In crashing a project network, which of the following is/are true? (a) (b) (c) (d) (e) The first activity to be crashed is the least expensive activity on the critical path. All paths with the longest time in the network must be reduced simultaneously. Crashing should be done on non-critical activity. First crash any activity with Total float zero. First crash the activity with a positive Total float.

20) Which of the following statements is/are true for (AOA) PERT network, in general? (a) (b) (c) (d) (e) The network is drawn so as to indicate precedence relationships. Network should not have a critical path. Each node represents the beginning or end of an activity. Each node consumes time. Each activity consumes time.

21) With respect to a general two-person zero-sum game which of the following is/are true? (a) (b) (c) (d) (e) The strategies of only two players are given. Strategies of only one player are given. There can be only two strategies. Pay off table is given. Strategies of the players are not necessary at all.

22) Consider the following Payoff matrix of a game to a player A

Player A

I II III

I 8 6 -2

Player B II -2 5 4

III 9 6 -9

IV -3 8 5

The optimal solution of the game to A and B is (a) (b) (c) (d) (e) Player A plays I and Player B plays I. Player A plays II and Player B plays II. Player A plays II and Player B plays III. Player A plays IV and Player B plays II. Player A plays IV and Player B plays III.

To answer questions (23) and (24) use the following payoff matrix of a game.

Player A

I II III IV

I 3 3 4 2

Player B II 2 4 2 4

III 4 2 4 0

IV 2 8 2 6

23) Optimal Strategy for player A is

1 1 2 2 2 1 (d) 0,0, , 3 3
(a) , ,0,0 24) The value of the game for player A is (a) 1/3 (d) 6/5

(b) 0,0, ,

1 2 3 3 1 1 (e) 0, , ,0 2 2

(c) 0,0, ,

1 3 4 4

(b) 2/3 (e) 2

(c) 3

25) For a single-channel queuing model with Poisson arrivals and Exponential service times, which of the following can be obtained as a result? (L-number of customers and W-waiting time of the customers, s-system and q-queue) (a) Ls < L q. (d) Ls > Lq (b) Ws < W q. (e) Ls = Lq (c) Wq < Ws.

26) In a queuing model, the notation M/M/s stands for a waiting line which has (a) (b) (c) (d) (e) Poisson input, exponential service times, s service channels. Constant input and service times and s service channels. Poisson input, constant service times and s service channels. Exponential inter arrival times and service times and s service channels. Poisson input, Poisson output and s service channels.

Read the following data to answer questions 27, 28 and 29. A mango canning factory receives the following orders for the 3 weeks of its canning season. week Order mi (1000' s of crates ) 1 2 2 1 3 3

The canning factory can produce up to 8000 crates in one week, but any extra crates which are produced in a particular week have to be stored until they are required. The production cost (ci) of a crate is Rs.7. The storage cost is Rs. 10 per week per crate. If no crates are produced in any given week or weeks, then the company can close the factory during that number of week(s) and save Rs. 40,000 per week in overheads. There should be no crates at the beginning or at the end of the 3 week period. Let xi number of crates produced in week i, i=1, 2, 3. di- number of crates in storage. d0=d3=0 b(xi)=1 if xi=0, b(xi)=0 if xi>0 for i=1,2,3. Zi(di)- total cost at stage i, minimum value is Z*i(di). 27) Possible values of x1s and the corresponding d1s at stage 1 are (a) (2,1,3),(0,0,0) (c) (0,1,2,3,4,5,6),(0,1,2,3,4,5,6) (e) (2,3,4,5,6),(0,0,0,0,0) (b) (2,1,3)(0,1,3) (d) (2,3,4,5,6),(0,1,2,3,4,)

28) The recursive formula/formulae for the total cost at stage i : zi(di) is/are : (a) ci x i + s d i 40b( xi ) + z i 1 ( d i 1 ) . (c) ci x i + s d i 40b( xi ) + z i ( d i ) . (e) ci xi + s ( d i 1 + xi mi ) 40b( xi ) + z i 1 ( d i 1 ) . 29) If the production plan (x1,x2,x3) for the 3 weeks is (3,0,3), the total cost of canning (in Rs.1000s) is (a) 12 (d) -9 (b) 42 (e) 11 (c) 82 (b) ci x i + s d i 40b( xi ) + z i ( d i 1 ) . (d) ci x i + s d i 1 40b( xi ) + z i ( d i ) .

30) Which of the following is/are advantages of simulation over analytic methods? (a) (b) (c) (d) (e) Information about the distribution of random quantities in the system is not necessary. Results of simulations are always more precise than those using analytical methods. Any system can be analyzed effectively by means of a simulation. Simulation can be implemented in the computer. Actual observations of a system need not be made.

********