Sant Baba Bhag Singh University Job Turning Ai Threading Bi Knurling Ci
End Semester Examination – Sept2019 1 3 8 13
Course/Branch- B.com H+R 2 12 6 14 Semester – 5th 3 5 4 9 Subject Code – MAT204 4 2 6 12 Subject Name – Introduction to Operation Research 5 9 3 8 Maximum Marks: 50 Time: 3 Hours 6 11 1 13 Instructions to Candidates: 1. Section A is compulsory consisting of Ten Questions Section C 2. Section B contains Five questions carrying Five marks each and students have to attempt any four questions. Q7 A project has the following characteristics 3. Section C contains THREE questions carrying TEN marks each and students have to attempt any two questions Section A Q1. a. What is Degeneracy? b. Explain Feasible solution c. What are Activities in PERT? d. Define Dangling. e. Explain Least cost method? Construct a network and Find the critical path f. Elaborate CPM? Q8 Solve the Assignment problem g. Define Strategy? h. What is Multiple optimal solution in LPP? i. What is Pay-off Matrix? j. When an assignment problem is said to be unbalanced?
Section B (5 Marks Each) 5x4 Q9 Use the principle of dominance to solve this problem.
Q2 Explain Hungarian Assignment method.
Q3 What are the Features of Operation Research? Q4 Maximize z = x1 + 5x2 subject to 3x1 + 4x2 ≤ 6, x1 + 3x2 ≥ 2, x1, x2 ≥ 0 Q5 Explain different methods of game theory. Q6 A machine operator has to perform 3 operations, Turning, Threading & Knurling on three machines A, B & C in the order ABC. Find the optimum sequences when the time in hours are given. End of Question Paper Maximize z = 3 X1 + 2 X2 Sant Baba Bhag Singh University subject to End Semester Examination – Nov 2018 -X1 + 2X2 ≤ 4, 3 X1 + 2 X2 ≤ 14, X1 – X2 ≤ 3, X1, X2 ≥ 0 Course/Branch- B.com H+R Q6. Explain applications of linear programming methods. Semester – 5th Subject Code – MAT204 Subject Name – Introduction to Operation Research Section C Maximum Marks: 50 Time: 3 Hours Instructions to Candidates: Q7.A project has the following characteristics 1. Section A is compulsory consisting of Ten Questions 2. Section B contains Five questions carrying Five marks each and students have to attempt any four questions. 3. Section C contains THREE questions carrying TEN marks each and students have to attempt any two questions Section A Q1. a. What is Artificial variable? b. What is Unique optimal solution? c. Define Events/Nodes Construct a network and Find the critical path d. What is Dangling event? Q8 Solve the assignment problem : e. Explain Multiple optimal solutions f. What is Unbalanced assignment problem? g. Explain North west corner rule h. Elaborate PERT Networks i. Define Strategy j. Define Operation Resaerch. Q9. Solve the below mentioned problem using appropriate method. Section B (5 Marks Each) 5x4 Q2 What are the Applications operation research Q3 In a factory, there are six jobs to process, each of which should go to machines A & B in the order AB. The processing timings in minutes are given, determine the optimal sequencing & total elapsed time. Jobs 1 2 3 4 5 6 Machine A 7 4 2 5 9 8 Machine B 3 8 6 6 4 1
End of Question Paper
Q4 Distinguish between Assignment Problem and Transportation Problem Q5. Solve: