1) The document contains questions from an Operations Research exam for Bachelor of Engineering students. It covers topics like phases of OR study, simplex method, duality theory, transportation and assignment problems, PERT, CPM, and project management.
2) It asks students to list applications and limitations of OR, solve LPP problems using simplex and dual simplex methods, compare transportation and assignment problems, solve a transportation problem to maximize profit, solve a minimal spanning tree and game theory problem, and analyze a project network using PERT/CPM.
3) Students are asked to identify the critical path of a project, calculate time-related parameters, differentiate PERT and CPM, and explain Fulk
1) The document contains questions from an Operations Research exam for Bachelor of Engineering students. It covers topics like phases of OR study, simplex method, duality theory, transportation and assignment problems, PERT, CPM, and project management.
2) It asks students to list applications and limitations of OR, solve LPP problems using simplex and dual simplex methods, compare transportation and assignment problems, solve a transportation problem to maximize profit, solve a minimal spanning tree and game theory problem, and analyze a project network using PERT/CPM.
3) Students are asked to identify the critical path of a project, calculate time-related parameters, differentiate PERT and CPM, and explain Fulk
1) The document contains questions from an Operations Research exam for Bachelor of Engineering students. It covers topics like phases of OR study, simplex method, duality theory, transportation and assignment problems, PERT, CPM, and project management.
2) It asks students to list applications and limitations of OR, solve LPP problems using simplex and dual simplex methods, compare transportation and assignment problems, solve a transportation problem to maximize profit, solve a minimal spanning tree and game theory problem, and analyze a project network using PERT/CPM.
3) Students are asked to identify the critical path of a project, calculate time-related parameters, differentiate PERT and CPM, and explain Fulk
1) The document contains questions from an Operations Research exam for Bachelor of Engineering students. It covers topics like phases of OR study, simplex method, duality theory, transportation and assignment problems, PERT, CPM, and project management.
2) It asks students to list applications and limitations of OR, solve LPP problems using simplex and dual simplex methods, compare transportation and assignment problems, solve a transportation problem to maximize profit, solve a minimal spanning tree and game theory problem, and analyze a project network using PERT/CPM.
3) Students are asked to identify the critical path of a project, calculate time-related parameters, differentiate PERT and CPM, and explain Fulk
Siddaganga Institute of Technology, Tumkur – 572 103
(An Autonomous Institution affiliated to VTU, Belagavi, Approved by AICTE, Programmes Accredited by NBA, New Delhi, An ISO9001:2008 Certified Institute)
Odd Semester Bachelor of Engineering Examinations Nov-Dec. 2016
Operations Research Time: 3 Hours Max. Marks: 100 Note : 1. Question No. 1 is Compulsory. 2. Answer any 4 full questions from question No. 2 to Question No. 6
1 a) List different phases of OR study.
b) In simplex algorithm ______ method is used to deal with the situation where an infeasible starting basic solution is given. c) Write two properties of Duality theory. d) Name two methods to find basic feasible solution for a transportation problem. e) In assignment problem the values of xij will be ______ or ______. f) What is degeneracy in transportation problem? g) Define i) pure strategy ii) mixed strategy h) If the value of the game is zero, then the game is known as ______ and the game having non zero value is known as ______. i) PERT stands for ______ and CPM for ______. j) List 3 phases involved in managing a large project. 2 10
2 a) Briefly explain any 4 applications and 4 limitations of operations research. 8
b) Solve the given problem by simplex method. Max z = x1 - x2 + 3x3 Subject to x1 + x2 + x3 10 2x1 – x3 2 2x1 – 2x2 + 3x3 0 x1, x2, x3 0 12
3 a) Obtain the dual of the given LPP.
Max z = 3x1 + x2 + x3 - x4 Subject to x1 + 5x2 + 3x3 + 4x4 5 x1 + x2 = -1 x3-x4 -5 x1, x2, x3, x4 0 6 b) Use dual simplex method to solve the LPP. Min z = x1 + x2 Subject to 2x1+x2 2 -x1 – x2 1 x1, x2 0 14
4 a) Write any 4 difference/comparisons between transportation and assignment problems. 4
b) A departmental store wishes to purchase the following quantities of sarees. Type of Saree A B C D E Qnty 150 100 75 250 200 16
-1- Please Turn Over
-2- OE06 Tenders are submitted by 4 different manufacturers who undertake to supply not more than the quantity mentioned below. Mnfr W X Y Z Qnty 300 250 150 200 The store estimates that its profit per saree varies with the manufacturer as shown by the following matrix. A B C D E W 275 350 425 225 150 X 300 325 450 175 100 Y 250 350 475 200 125 Z 325 275 400 250 175 Suggest the order to be placed so as to maximize the profit. 5 a) A salesman has to visit 5 cities, A, B, C, D and E. The distance (Kms) between the 5 cities are as follows. A B C D E A 7 6 8 4 B 7 8 5 6 C 6 8 9 7 D 8 5 9 8 E 4 7 7 8 Determine the optimum route. 10 b) Solve the game, I II III IV V VI I 0 0 0 0 0 0 II 4 2 0 2 1 1 III 4 3 1 3 2 2 IV 4 3 7 -5 1 2 V 4 3 3 -1 2 2 VI 4 3 3 -2 2 2 10 6 a) A project consists of the following activities with their precedence relationship and duration in days. i) Draw the project network ii) Identify the critical path and the project duration. iii) Calculate earliest starting and finishing times, latest starting and finishing times, total float, free float, independent float and interference float Activity Precedence Duration (days) A - 10 B A 8 C A 7 D B 9 E B 6 F B, C 10 G B, C 4 H D, F 12 12 b) Differentiate PERT and CPM 4 c) Explain Fulkerson rule for numbering events of a project network with example. 4 ________