This action might not be possible to undo. Are you sure you want to continue?

# 1

**OPERATION RESEARCH QUESTION BANK PART-I
**

1. Formulate the dual of the following LPP: Maximise : z= 2x1 + 3x2 Subject to Constraints: -x1 + 2x2 ≤ 4 x1 + x2 ≤ 6 x1 + 3x2 ≤ 9 x1, x2 ≥ 0 2. From the following two persons zero sum game find the value of the game: 8 6 -2 B -3 7 -4 5 2 -3

A

3. A project is characterized by activities A and G and the times required and costs for regular programme for each activity are as follows: Event 1 1 2 3 2 4 5 Activity Event 2 3 4 4 5 6 6 Name of Activity A B C D E F G Time (weeks) Regular 5 2 3 4 4 3 5

Draw a network for the problem using only time for regular programme activities. Trace the critical path and state how long will it take to complete the project. What would be the cost of completing this project in this fashion? 4 . Solve the following LPP by Simplex method: Maximize : Z = 4X1 + 3X2 Subject to : 2X1 + X2 ≤ 72 X1 + 2X2 ≤ 48 X1 ≥ 0, X2 ≥ 0

) A P Destination Q R Availability (units) 2 7 4 5 3 3 1 8 5 4 7 1 6 2 7 9 18 34 B C D Requirement (units) 7 14 6. X4 each of which requires resources I. Solve the following Transportation Problem : Origins Cost (Rs. The data available are as per table given below : Products Resource I II III Contribution Per unit (Rs. II and III. X2. The repairers have some different kinds of skills and exhibit different levels of efficiency from one job to another. An automobile dealer wishes to put 4 repairmen to 4 different jobs. X3. The dealer had estimated the number of man hours that are required for each job man combination.) X1 1 6 2 3 X2 1 4 4 4 X3 1 2 9 6 X4 1 1 10 10 Total availability (units) 12 90 70 . This is given in the matrix form as follows: Jobs A B C D 5 3 2 8 7 6 5 9 4 7 2 5 7 6 7 8 1 2 3 4 7. A company manufactures four products X1.2 5.

F.5 9 3. Solve the game whose payoff matrix is given by Play B 1 Play A 0 1 3 -4 5 1 -3 -1 9.41 is 0.33 . 10 Time Estimates (in weeks ) Activity A B C D E F G H (i) (ii) (iii) Preceding Activity None None A A A B.3 It is required to find the quantities of each product that would maximize the contribution 8.C D E.1591 and the value of z which covers 49% of area is 2.E Estimated Time (months) 9 12 15 6 30 29 32 Construct a network diagram . how many weeks before that date should be start the project work. (Area of normal curve between z = 0.G Optimistic 2 10 8 10 7 9 3 3 Most Likely 4 12 9 15 7. what is the probability that the project will be finished within the time limit? If the project manager wants to be 99% sure that the project is completed on the scheduled date.5 5 Pessimistic 12 26 10 20 11 9 7 5 Determine the critical path If a 30 weeks deadline is imposed. You are given the following information: Project Event 1 1 1 2 3 4 5 Activities To event 2 3 4 5 5 6 6 Name of the activity A B C D E F G Preceding Activities A B C D.

tp and. . Determine the optimum strategies and the value of game for the payoff matrix: B 2 −2 4 A −1 4 2 2 1 6 12. Player B B1 5 -3 B2 -1 9 B3 11 -5 B4 -3 3 B5 13 1 A1 Player A A2 15. find the optimal mixed strategies for both players A and B and the value of the game for the following competitive situation.C B. What is the expected time of the activity and is standard deviation? 13. Using the graphical technique. tm are 4. Assume that the time estimates for an activity in a PERT network t0. Consider the following project : Activity A B C D E F G Predecessor Activity A A B.C F Activity duration (days ) 15 12 7 34 28 18 14 (i) Construct the PERT chart (ii) Determine the project Completion Time. 12 and 5 weeks respectively.4 11. Determine the value of the following game : Player B -2 3 -4 8 A1 Player A A2 14.

Consider the following projects activities : Predecessor Activity A A B.5 16. X Y Z A 9 3 10 B 6 ⊗ 8 C 10 2 9 Typist 18. For the PERT chart Determine the project completion time (i) What is the critical path? (ii) What are the critical activities? A 12 C 5 F 16 6 2 B 20 14 4 D 28 E 10 H 3 G 5 1 7 . x2 ≥ 0 Solve this problem using the Simplex algorithm. 19.C F Activity A B C D E F G Construct the PERT chart for the project. Assign the Typists to the Departments such that the total number of letters typed is maximum ⊗ represents a situation where a given typist can be assigned to the particular department. Consider the following LP Problem: Maximize z = 4x1 + 6x2 + 8x3 Subject to constraints .C B. 17.4x1 + 2x2 + 2x3 ≤ 20 3x2 + 6x3 ≥ 45 and x1.

Solve the game with the following pay-off matrix Player B1 9 7 13 8 B2 10 1 6 3 B3 5 -3 -1 2 B B4 2 3 12 -3 B5 11 5 10 4 Player A A1 A2 A3 A4 21. Using North west Corner rule and MODI solve the transportation problem with unit . Given the following payoff matrix. Player B B1 A2 3 A2 3 A3 4 A4 0 B2 2 4 2 4 B3 4 2 4 0 B4 0 4 0 8 23.6 20. 22. find the value of the game and strategies both the players can play. Consider the transportation problem shown in the tableau below: To From Source A B C Demand 200 Destination K L M 6 5 15 21 9 10 24 12 N 8 7 11 Supplier 300 200 300 300 100 200 Solve this problem so that the total cost of transporting good from all Sources to destination is minimum.

7 transportation costs.) 450 75 300 120 190 130 110 Activity 1-2 2-3 2-4 2-5 3-4 4-6 5-6 (i) Draw the network and find out the critical path and the normal project duration . availability and demand as given below: Availability (in units) Destinations Origin 01 02 03 Demand (in units) D1 D2 D3 D4 6 12 4 40 2 6 6 50 8 16 18 130 9 12 4 60 80 80 120 280 24. what would be the minimum crash duration possible. (iv) With the crash durations indicated. (iii) If the indirect costs are Rs. 100 per week. find out the optimum duration by crashing and the corresponding projects costs. Solve the following Transportation problem by taking the initial basic feasible Solution by North West Corner Rule From 1 2 3 4 5 To 1 13 12 10 11 15 2 14 11 12 13 14 3 12 14 15 12 11 4 11 13 13 14 12 Supply 120 120 60 80 20 Demand 160 120 80 40 400 26. (ii) Find out the total float associated with each activity. Obtain the optimal assignment from the following table: I II III IV . The following table gives data on Normal time.) 300 75 200 120 100 90 60 Crash Cost (in Rs. Crash time. ignoring indirect costs? 25. Normal cost and Crash cost of a project Normal Time (in weeks) 3 3 5 4 4 3 3 Crash Time (in weeks) 2 3 3 4 1 2 1 Normal Cost (in Rs.

The owner of a Machine shop has four machinists available to assign to jobs for the day.F. To solve the following transportation problem. Player A a1 a2 a3 a4 b1 4 4 4 4 Player B b2 3 4 2 4 b3 1 3 9 2 8. 30. The details of a small project are given below: Draw the network Activity Dependence Duration (in days) Activity Dependence Duration (in days) A 9 H E 8 B 4 I D.8 160 135 140 50 130 120 110 50 175 130 125 80 190 160 170 80 A B C D 27. Four jobs are offered with an expected profit in rupees for each machinist on each machinist on each job as follows: Jobs A B C D 1 Machinists 2 3 4 62 71 87 48 78 84 92 64 50 61 111 87 101 73 71 77 Determine the assignment of machinists to jobs that will result in a maximum Profit. Determine the optimal strategies for both the players and the value of the game from the following payoff matrix. Obtain the initial solution .J 10 E A 7 L G 2 F C 5 G E 10 29.C 8 K I.H 6 C 7 J E 9 D B.

most likely. 32. m. A small project consisting of eight activities has the following characteristics : Activity Preceeding Activity Time Estimates (in weeks) a 2 m 4 b 12 13 15 23 A 10 12 26 A 8 9 10 A 7 8 9 B.) 600 200 300 400 300 300 600 500 400 Normal Crash Cost (Rs.9 by VAM method.F 5 5 5 G 6 8 10 A B C D E F G H a. Draw PERT. (i) Find the total float and free float for each activity.most optimistic.) 720 200 440 700 420 600 900 800 700 Draw the activity network of the project. 33.most pessimistic. find critical path and project completion time. (ii) Using the above information crash the activity step by step until all the paths are critical. b.C 9 10 17 D 3 4 5 E. Solve the following Transportation Problem: . Destination 1 7 5 3 40 2 3 2 6 100 3 8 6 5 120 4 5 11 2 180 Supply 160 180 100 440 Source A B C Demand 31. The following table gives the activities in a Project: Activity Time (days) 1-2 1-3 2-3 2-4 3-4 4-5 4-6 5-7 6-7 20 25 10 12 5 10 5 10 8 Normal Time (Days) 17 25 8 6 2 5 3 5 3 Crash Cost (Rs.

M/C A 7 4 9 3 B 4 6 3 6 C 8 10 7 9 D 5 6 2 6 Job 1 2 3 4 36. To From P1 Plants P2 P3 Demand D1 2 7 4 5 Distribution Centre D2 3 3 1 8 D3 5 4 6 7 D4 1 6 2 15 7 10 18 Supply 35.10 Plants P1 Warehouses W1 W2 W3 W4 W5 Supply 500 5 8 12 5 6 300 P2 7 6 10 18 3 600 P3 13 14 9 12 5 200 P4 10 13 11 14 4 400 P5 9 22 14 20 14 200 P6 8 15 26 7 9 2. Find the optimum assignment for the following problem. Find the initial basic feasible solution by Vogel’s approximation method find the cost that allocation. .200 Demand 300 200 400 600 700 34. Draw the Network for the following project.

To X From A B C D 3 5 6 4 21 Y 3 1 4 1 26 Z 5 3 4 4 17 W 4 3 3 2 17 15 35 12 19 Availability Demand 38. Draw the PERT NETWORK for the following case. Solve the following transportation problem and obtain optimum solution. Solve the game given in the table below. Time Required in Days Activity Immediate Precedence Requirement Optimistic A B A D A F G C.E 37.11 Activity A B C D E F G Immediate Predecessor activities Start Start Start A C A B.I. Identify the critical path.H G L. .D. Find the expected project completion time.E.J A 3 4 2 3 1 7 1 0 10 15 2 10 Most likely 4 7 7 5 5 8 7 0 10 20 7 15 Pessimistic 5 10 12 13 9 21 7 0 10 25 12 20 A B C D E F G H I J K L 39.

Activity A B C D E F G H Immediate predecessor activity A B B D. Find the value of the following game: Player B Player A 2 -1 1 0 43. Draw the network for the following activities and precedence relationship.E F. Determine the basic feasible solution and optimum solution for the following transportation problem: Destinations . Time taken by each programmer on each job is shown in the table below.G 42. Find an optimum assignment. Programmers P1 9 4 4 7 P2 3 4 6 4 P3 7 10 9 8 2 5 6 5 P4 A Job B C D 41.12 B 20 8 A 13 9 6 8 5 3 15 6 8 19 4 7 14 1 40. Four computer programming hobs have to be assigned to four programmers.C.

Find the critical path.C E C F G. Solve the following transportation problem. Apply North-West corner rule to the following TP D1 01 From 02 03 2 1 5 To D2 3 2 4 D3 4 3 3 Availability 10 18 12 Requirement 15 20 5 46.13 D1 P1 P2 P3 P4 12 3 5 8 40 D2 9 5 3 2 40 D3 10 5 11 10 20 D4 9 7 9 11 60 D5 6 7 11 2 20 Supply 50 40 10 80 180 44. To . Draw an arrow diagram to represent the following project. Draw the network consisting of the following activities.H G D H B I F J G K E. project duration. variance of the critical path. A Activity Immediate Predecessor : B A C D B.I.J 47. Duration (Days) Activity 1-2 1-4 2-3 2-5 3-6 4-5 4-7 5-6 6-8 7-8 t0 4 3 5 1 3 2 5 6 2 2 tm 6 9 7 4 7 4 11 12 5 5 tp 28 15 15 7 11 6 17 30 14 8 45.

Cost of Transport D1 01 02 03 Requirement 5 4 6 30 D2 8 5 2 40 D3 3 7 4 20 D4 6 4 6 10 Availability 30 50 20 100 50. A project consists of 9 jobs the following precedence relations and estimates of time. The following table gives the jobs of a network along with their time estimates. Use Vogel’s Approximation method to obtain an initial basic feasible solution.14 W1 F1 From F2 F3 Requirement 5 4 2 200 W2 7 6 6 300 W3 3 9 4 400 W4 8 5 5 100 Capacity 300 500 200 1000 48. Draw a project network. . Duration days Job i-j Optimistic Most likely Prssimistic 15 14 30 8 17 15 27 7 28 1-2 3 6 1-6 2 5 2-3 6 2 2-4 2 5 3-5 5 11 4-5 3 6 6-7 3 9 5-8 1 4 7-8 4 19 Draw the project network and find the critical path. 49.

B 10 E B 5 F D.15 Job Predecessor Time (day) A 15 B 10 C A. Draw a project Network and determine the critical path. (i) Explain a two person zero-sum game with examples. Job 1-2 Duration 2 2-3 7 2-4 3 3-4 3 3-5 5 4-6 3 5-8 5 6-7 8 6-10 4 7-9 8-9 4 1 9-10 7 53. Solve the following transportation problem with unit transportation costs given as under: Destinations Origins 01 02 03 Demand D1 40 44 38 40 D2 25 35 38 20 D3 22 30 28 60 D4 33 30 30 30 Supply 100 30 70 55.F 20 H D.B 10 D A. The following table gives the activities of a project and their duration in days. A project has the following characteristics and time estimates. A project consists of the following 12 jobs. E 5 G C. (ii) What are the different steps in managerial decision making? Explain with an example. Pessimistic time (b) Construct a PERT network.H 15 51.E 10 I G. Optimistic time (a) Most likely time (m). Activity a b m 1-2 1 5 1. 52.5 2 2-3 1 3 3 2-4 1 5 4 3-5 3 5 3 4-5 2 4 5 4-6 3 7 5-7 4 6 5 7 6-7 6 8 7-8 2 6 4 6 7-9 4 8 2 8-10 1 3 9-10 3 7 5 56. Find the critical path. 54. The following table gives the activities of a construction project and duration (in days ) Activity Duration 1-2 20 1-3 25 2-3 10 2-4 12 3-4 6 4-5 10 Draw the network diagram and find the critical path. .

decision making under uncertainty 59. A network diagram with PERT time estimates.Activity Duration 1-2 7 1-6 6 2-3 14 2-4 5 3-5 11 4-5 7 6-7 11 5-8 4 16 7-8 18 57. Discuss the solution of the following game. with the following costs of transportation. The following table gives the activities of construction project and duration. is given below. Solve the following transportation problem. (i) Explain. Solve the following transportation problem. with suitable illustrative examples. 6-12-30 5-11-17 3 2 2-5-8 3-6-15 1 2-5-14 6 3-9-27 62. with pay-off for player A Player B 7 4 3-6-15 5 1-4-7 8 4-19 -28 . Activity 1-2 1-3 1-4 2-4 2-5 3-4 4-5 Duration (days) 3 2 6 5 7 2 4 60. (i) Explain the use of probability in Decision theory. demand and supply : Destination D1 D2 D3 D4 D5 Supply 01 02 03 Demand 10 20 30 25 15 40 35 115 20 15 40 60 20 30 55 30 40 30 25 70 50 100 150 61. with given cost coefficients: Destination D1 D2 D3 D4 Availabilities 01 Origins 02 03 Requirements 15 16 12 30 10 13 17 30 17 12 20 40 18 13 11 50 20 60 70 58. Find the critical path and also determine the project completion time and is variance .

supply and demand: Destination D1 D2 D3 D4 Supply 01 2 2 2 1 3 Origins 02 10 03 Demand 7 4 8 6 3 5 6 4 4 8 4 7 5 Prepared by Prof.M.17 8 2 9 5 6 5 7 18 Player A 7 3 −4 10 63. Alphonse Ligori . Solve the following transportation problem with the following information on costs. L .