10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?

method=viewQuestionsInPopup

CHRIST (Deemed to be University),

Questions View-V Semester
Subject : MAT541EN(OPERATIONS RESEARCH)

U1--Introduction to linear programming and Applications

U1-T1-S1--A1

1 Construct the standard form of the linear programming problem MinZ = 1200x 1 + 800x 4 subject to 3.0 Medium Problem
30x 1 ≥ 400 , 60x 1 + 20x 2 ≥ 800, 40x 1 + 100x 2 ≥ 880, x 1, x 2 ≥ 0. (Applying/Analysing) oriented

2 Construct the standard form of the linear programming problem MaxZ = 80x 1 + 40x 2 + 120x 3 − 10x 4 subject 3.0 Complex(Evaluating/Creating) Problem
to the constraints x 1 + 2x 2 + x 3 + 5x 4 ≤ 150, x 2 − 4x 3 + 8x 4 = 70, 6x 1 + 7x 2 + 2x 3 − x 4 ≥ 120 and oriented
x 1, x 2, x 3, x 4 ≥ 0.
3 Construct the standard form of the LPP MaxZ = 2x 1 + 3x 2 + 4x 3 subject to the constraints 3.0 Complex(Evaluating/Creating) Problem
3x 1 + x 2 + 6x 3 ≤ 600, 2x 1 + 4x 2 + 2x 3 ≥ 480, 2x 1 + 3x 2 + 3x 3 = 540 and x 1, x 2, x 3 ≥ 0. oriented

4 Construct the standard form of the LPP MaxZ = 10x 1 + 15x 2 + 8x 3 subject to the constraints 3.0 Medium Problem
x 1 + 2x 2 + 2x 3 ≤ 200, 2x 1 + x 2 + x 3 ≤ 220, 3x 1 + x 2 + 2x 3 ≤ 180, x 1 ≤ 10, x 2 ≤ 20, x 3 ≤ 30 and x 1, x 2, x 3 ≥ 0. (Applying/Analysing) oriented

5 Construct the standard form of the LPP MinZ = 2x 1 + 5x 2 + 3x 3 subject to 3.0 Medium Problem
3x 1 + x 3 ≥ 10, 5x 1 + x 2 + 2x 3 ≥ 15, x 1 + 2x 2 ≥ 8, x 1, x 2, x 3 ≥ 0. (Applying/Analysing) oriented

6 Construct the standard form of the LPP: Minimize P = x + y + z subject to the constraints x − 3y + 4z = 5, 3.0 Complex(Evaluating/Creating) Problem
x − 2y ≤ 3, 2y − z ≥ 4 and x, y ≥ 0 z is unrestricted. oriented
7 Construct the standard form of the LPP: Minimize Z = 5x + 3y subject to the constraints 2x + 4y ≤ 12, 3.0 Medium Problem
2x + 2y = 10, 5x + 2y ≥ 10 and x, y ≥ 0. (Applying/Analysing) oriented
8 Construct the standard form of the LPP: Minimize P = x − 3y + 3z subject to the constraints 3x − y + 2z ≤ 7, 3.0 Medium Problem
2x + 4y ≥ − 12, − 4x + 3y + 8z ≤ 10 and x, y, z ≥ 0. (Applying/Analysing) oriented
9 Construct the standard form of the LPP: Minimize P = 2x + 5y + 5z subject to the constraints 3.0 Medium Problem
3x + 10y + 5z ≤ 15, 33x − 10y + 9z ≤ 33, x + 2y + z ≥ 4 and x, y, z ≥ 0. (Applying/Analysing) oriented
10Construct the standard form of the LPP: Minimize Z = 2x + y subject to the constraints x + 4y ≤ 1, x + 2y ≥ 4 3.0 Simple Problem
and x, y ≥ 0. (Remembering/Understanding) oriented
11 Give the standard form of the LPP MinZ = 3x 1 + 4x 2 subject to the constraints 2x 1 + 3x 2 ≥ 90, 3.0 Simple Problem
4x 1 + 3x 2 ≥ 120 and x 1, x 2 ≥ 0. (Remembering/Understanding) oriented

12Construct the standard form of the LPP: Minimize Z = 4x + y subject to the constraints 3x + y ≥ 15, 3.0 Simple Problem
4x + 3y ≥ 18, x + 2y ≤ 20 x, y ≥ 0. (Remembering/Understanding) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

13Construct the standard form of the linear programming problem MinZ = 20x 1 + 24x 2 + 18x 3 subject to the 3.0 Medium Problem
constraints 20x 1 + 10x 2 + 10x 3 ≥ 300, 10x 1 + 10x 2 + 10x 3 ≥ 200, 10x 1 + 20x 2 + 10x 3 ≥ 240 and (Applying/Analysing) oriented
x 1, x 2, x 3 ≥ 0.
14Construct the standard form of the LPP: Minimize P = 3x + 2y + z subject to the constraints 2x + 5y + z ≥ 12, 3.0 Complex(Evaluating/Creating) Problem
3x + 4y ≥ 11, x + 2y + z ≥ 4 and x is unrestricted, y, z ≥ 0. oriented
15Give the standard form of the LPP MinZ = 9x 1 + 10x 2 subject to the constraints 3.0 Simple Problem
2x 1 + 4x 2 ≥ 50, 4x 1 + 3x 2 ≥ 24, 3x 1 + 2x 2 ≥ 60, , x 1, x 2 ≥ 0. (Remembering/Understanding) oriented

16Construct the standard form of the LPP: Maximize Z = 2x + y subject to the constraints x − 0.5y ≥ 1, x − y ≤ 2 3.0 Medium Problem
, x + y ≤ 4 and x, y ≥ 0. (Applying/Analysing) oriented
17Construct the standard form of the LPP: Minimize Z=13x+15y subject to the constraints 3x+5y≥50,6x+8y≥24, 3.0 Medium Problem
9x+3y≥60 and x,y≥0. (Applying/Analysing) oriented
18Construct the standard form of the linear programming problem MinZ=4x1+5x2 subject to the constraints 3.0 Medium Problem
2x1+4x2≥50, 4x1+3x2≥24, 3x1+2x2≥60 and x1,x2≥0. (Applying/Analysing) oriented

U1-T1-S2--A2

19 How to identify that the solution of given LPP leads to an unbounded solution? 3.0 Complex(Evaluating/Creating) Problem
Give example. oriented
20 What are the indications of the alternative optima in the simplex table of the given 3.0 Simple Problem
LPP? (Remembering/Understanding) oriented
21 List the indications of degeneracy in the simplex table of a LPP. 3.0 Medium Problem
(Applying/Analysing) oriented
22 List the indications of the infeasible solution space in the simplex table of the given 3.0 Medium Problem
LPP. (Applying/Analysing) oriented
23 Define slack and surplus variables. 3.0 Medium Descriptive
(Applying/Analysing)
24 What is an objective function? Explain with examples. 3.0 Medium Descriptive
(Applying/Analysing)

U1-T1-S3--B1

25 Solve the linear programming problem MinZ = 5x 1 − 4x 2 + 6x 3 − 8x 4 subject to 8.0 Medium Problem
x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 40 , 2x 1 − x 2 + x 3 + 2x 4 ≤ 8, 4x 1 − 2x 2 + x 3 − x 4 ≤ 10, x 1, x 2, x 3, x 4 ≥ 0 by (Applying/Analysing) oriented
using Simplex Method.
26 Find the solution of the linear programming problem MaxZ = 2x 1 + 5x 2 + 7x 3 subject to 8.0 Simple Problem
3x 1 + 2x 2 + 4x 3 ≤ 100, x 1 + 4x 2 + 2x 3 ≤ 100, x 1 + x 2 + 3x 3 ≤ 100, x 1, x 2, x 3 ≥ 0 by using Simplex (Remembering/Understanding) oriented
Method.
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

27 Solve the linear programming problem MaxZ = 3x 1 + 9x 2 subject to 8.0 Medium Problem
x 1 + 4x 2 ≤ 8, x 1 + 2x 2 ≤ 4, x 1, x 2 ≥ 0, by using simplex method. (Applying/Analysing) oriented
28 Maximize the objective function Z = 2x 1 + x 2 − 3x 3 + 5x 4 of a linear programming 8.0 Complex(Evaluating/Creating) Problem
problem, subject to x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 40 , 2x 1 − x 2 + x 3 + 2x 4 ≤ 8, oriented
4x 1 − 2x 2 + x 3 − x 4 ≤ 10, x 1, x 2, x 3, x 4 ≥ 0, by using Simplex Method.
29 Solve the linear programming problem MinZ = x 1 − 3x 2 + 2x 3 subject to 3x 1 − x 2 + 2x 3 ≤ 7, 8.0 Medium Problem
− 2x 1 + 4x 2 + 2x 3 ≤ 12, − 4x 1 + 3x 2 + 8x 3 ≤ 10, x 1, x 2, x 3 ≥ 0 by using Simplex Method. (Applying/Analysing) oriented
30 Solve the linear programming problem MaxZ = 3x 1 − x 2 + 3x 3 + 4x 4 subject to 8.0 Medium Problem
x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 40 , 2x 1 − x 2 + x 3 + 2x 4 ≤ 8, 4x 1 − 2x 2 + x 3 − x 4 ≤ 10, x 1, x 2, x 3, x 4 ≥ 0 by (Applying/Analysing) oriented
using Simplex Method.
31 Find the solution of the linear programming problem MaxZ = 8x 1 + 6x 2 + 3x 3 − 2x 4 subject to 8.0 Simple Problem
x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 40 , 2x 1 − x 2 + x 3 + 2x 4 ≤ 8, 4x 1 − 2x 2 + x 3 − x 4 ≤ 10, x 1, x 2, x 3, x 4 ≥ 0 by (Remembering/Understanding) oriented
using Simplex Method.
32 Maximize the objective function Z = x 1 + 9x 2 + x 3 of a linear programming problem, 8.0 Complex(Evaluating/Creating) Problem
subject to x 1 + x 2 + x 3 ≤ 9, 3x 1 + 2x 2 + 2x 3 ≤ 15, x 1, x 2, x 3 ≥ 0, by using Simplex Method. oriented

U1-T1-S4--B2

33 Maximize the objective function Z = 3x 1 + 2x 2 of a linear program problem, subject to 8.0 Complex(Evaluating/Creating) Problem
the constraints 2x 1 + x 2 ≤ 2 , 3x 1 + 4x 2 ≥ 12, x 1, x 2 ≥ 0 , by using Two-Phase Method. oriented

34 Maximize the objective function Z = x 1 + 2x 2 + 3x 3 − x 4 of the linear programming 8.0 Complex(Evaluating/Creating) Problem
problem, subject to the constraints x 1 + 2x 2 + 3x 3 = 15 , 2x 1 + x 2 + 5x 3 = 20, oriented
x 1 + 2x 2 + x 3 + x 4 = 10, x 1, x 2, x 3, x 4 ≥ 0, by using Big-M Technique.
35 Find the solution of the linear programming problem MaxZ = 3x 1 + 2x 2 + 3x 3 subject to 8.0 Simple Problem
the constraints 2x 1 + x 2 + x 3 = 2, x 1 + 3x 2 + x 3 = 6, 3x 1 + 4x 2 + 2x 3 = 8, x 1, x 2, x 3 ≥ 0 (Remembering/Understanding) oriented
by using Two-Phase Method.
36 Solve the linear programming problem MaxZ = 2x 1 + 5x 2 subject to the constraints 8.0 Medium Problem
3x 1 + 2x 2 ≥ 6 , 2x 1 + x 2 ≤ 2, x 1, x 2 ≥ 0 by using Two-Phase Method. (Applying/Analysing) oriented

37 Solve the linear programming problem MaxZ = 2x 1 + 3x 2 subject to the constraints 8.0 Medium Problem
x 1 + 2x 2 ≤ 4 , x 1 + x 2 = 24, x 1, x 2 ≥ 0 by using Two-Phase Method. (Applying/Analysing) oriented

38 Solve the linear programming problem MinZ = 4x 1 + x 2, subject to the constraints 8.0 Medium Problem
3x 1 + x 2 = 3, 4x 1 + 3x 3 ≥ 6, x 1 + 2x 2 ≤ 4, x 1, x 2 ≥ 0 by using Big-M Technique. (Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

39 Find the solution of the linear programming problem MaxZ = 6x 1 + 4x 2 subject to the 8.0 Simple Problem
constraints 2x 1 + 3x 2 ≤ 30 , 3x 1 + 2x 2 ≤ 24, x 1 + x 2 ≥ 3, x 1, x 2 ≥ 0 by using Two-Phase (Remembering/Understanding) oriented
Method.
40 Solve the linear programming problem MaxZ = 5x 1 − 4x 2 + 3x 3 subject to the constraints 8.0 Medium Problem
2x 1 + x 2 − 6x 3 = 20 , 6x 1 + 5x 2 + 10x 3 ≤ 76, 2x 1 − 3x 2 + 6x 3 ≤ 50, x 1, x 2, x 3 ≥ 0 by (Applying/Analysing) oriented
using Two-Phase Method.
41 Solve the linear programming problem MaxZ = 6x 1 + 4x 2 subject to the constraints 8.0 Medium Problem
2x 1 + 3x 2 ≤ 30, 3x 1 + 2x 2 ≤ 24, x 1 + x 2 ≥ 3, x 1, x 3 ≥ 0 by using Big-M Technique. (Applying/Analysing) oriented

42 Solve the linear programming problem MaxZ = 3x 1 + 2x 2 + 3x 3 subject to the constraints 8.0 Medium Problem
2x 1 + x 2 + x 3 ≤ 2, x 1 + 4x 2 + 2x 3 ≥ 8, x 1, x 2, x 3 ≥ 0 by using Two-Phase Method. (Applying/Analysing) oriented

43 Solve the linear programming problem MaxZ = 3x 1 − x 2 subject to the constraints 8.0 Medium Problem
2x 1 + x 2 ≥ 2 , x 1 + 3x 2 ≤ 2, x 2 ≤ 4, x 1, x 2 ≥ 0 by using Two-Phase Method. (Applying/Analysing) oriented

44 Find the solution of the linear programming problem MinZ = 4x 1 − 8x 2 + 3x 3 subject to 8.0 Simple Problem
the constraints x 1 + x 2 + x 3 = 7, 2x 1 − 5x 2 + x 3 ≥ 10, x 1, x 2, x 3 ≥ 0 by using Big-M (Remembering/Understanding) oriented
Technique.
45 Find the solution of the linear programming problem MaxZ = 2x 1 + 3x 2 − 5x 3 subject to 8.0 Simple Problem
the constraints x 1 + x 2 + x 3 = 7, 2x 1 − 5x 2 + x 3 ≥ 10, x 1, x 2, x 3 ≥ 0 by using Big-M (Remembering/Understanding) oriented
Technique.
46 Solve the linear programming problem MaxZ = x 1 + 2x 2 + x 3 subject to the constraints 8.0 Medium Problem
(Applying/Analysing) oriented
x 1 + x 2 + x 3 = 7 2x 1 − 5x 2 + x 3 ≥ 10, x 1, x 2, x 3 ≥ 0 by using Big-M Technique.
47 Solve the linear programming problem MaxZ = 3x 1 + 2x 2 subject to the constraints 8.0 Medium Problem
2x 1 + x 2 ≤ 2, 3x 1 + 4x 2 ≥ 12, x 1, x 2 ≥ 0 , by using Big-M Technique. (Applying/Analysing) oriented

48 Find the solution of the linear programming problem MaxZ = 2x 1 + 2x 2 + 4X 3 subject to 8.0 Simple Problem
(Remembering/Understanding) oriented
the constraints 2x 1 + x 2 + x 3 ≤ 2, x 1 + 4x 2 + 2x 3 ≥ 8, x 1, x 2, x 3 ≥ 0 by using Two-Phase
Method.
49 Minimize the objective function Z = 2x 1 + 3x 2 − 5x 3 of the linear programming problem, 8.0 Complex(Evaluating/Creating) Problem
subject to the constraints x + x + x = 7, 2x − 5x + x ≥ 10, x , x , x ≥ 0, by using oriented
1 2 3 1 2 3 1 2 3
Big-M Technique.

U1-T2-S1--A3

50 Find the dual of MinZ = 2x 2 + 5x 3 subject to the constraints 3.0 Simple Problem
(Remembering/Understanding) oriented
x 1 + x 2 ≥ 2, 2x 1 + x 2 + 6x 3 ≤ 6, x 1 − x 2 + 3x 3 = 4 and x 1, x 2, x 3 ≥ 0.
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

51 Construct the dual of MinZ = x 1 + x 2 + x 3 subject to the constraints 3.0 Medium Problem
x 1 − 3x 2 + 4x 3 = 5, x 1 − 2x 2 ≤ 3, x 1, x 2 ≥ 0 and x 3 is unrestricted. (Applying/Analysing) oriented

52 Construct the dual of MinZ = 3x 1 − 2x 2 + x 3 subject to the constraints 2x 1 − 3x 2 + x 3 ≤ 5 3.0 Medium Problem
, 4x 1 − 2x 2 ≤ 9, − 8x 1 + 4x 2 + 3x 3 = 8 and x 1, x 2 ≥ 0. and x 3 is unrestricted. (Applying/Analysing) oriented

53 Construct the dual of MinZ = 10x 1 + 12x 2 + 15x 3 subject to the constraints 3.0 Medium Problem
6x 1 + 7x 2 + 8x 3 ≥ 100, 7x 1 + 6x 2 + 10x 3 ≥ 120, 8x 1 + 9x 2 + 6x 3 ≥ 160 and x 1, x 2, x 3 ≥ 0 (Applying/Analysing) oriented
.
54 Give the dual of MaxZ = 5x 1 − 6x 2 + 4x 3 subject to the constraints 3x 1 + 4x 2 + 6x 3 ≥ 9, 3.0 Complex(Evaluating/Creating) Problem
x 1 + 3x 2 + 2x 3 ≥ 5, 7x 1 − 2x 2 − x 3 ≤ 10, x 1 − 2x 2 + 4x 3 ≥ 4, 2x 1 + 5x 2 − 3x 3 = 3and oriented

x 1, x 2, x 3 ≥ 0.
55 Find the dual of MaxZ = 3x 1 + 4x 2 + x 3 subject to the constraints x 1 + 2x 2 + 3x 3 ≤ 90, 3.0 Simple Problem
(Remembering/Understanding) oriented
2x 1 + x 2 + x 3 ≤ 60, 3x 1 + x 2 + 2x 3 ≤ 80 and x 1, x 2, x 3 ≥ 0.
56 Construct the dual of MinZ = 16x 1 + 9x 2 + 21x 3 subject to the constraints 3.0 Medium Problem
x 1 + x 2 + 3x 3 ≥ 16, 2x 1 + x 2 + x 3 ≥ 12, x 1, x 2, x 3 ≥ 0. (Applying/Analysing) oriented

57 Give the dual of MaxZ = 4x 1 + x 2 + 7x 3 subject to the constraints 3.0 Complex(Evaluating/Creating) Problem
x 1 + x 2 + x 3 = 10, 5x 1 − x 2 + x 3 ≥ 12, x 1 + 7x 2 − 3x 3 ≤ 4 and x 1, x 2, x 3 ≥ 0. oriented

58 Find the dual of Min Z=3x1+2x2+x3+x4 subject to the constraints 3.0 Complex(Evaluating/Creating) Problem
2x1+4x2+5x3+x4 ≥ 10, oriented
3x1−x2+7x3−2x4 ≤ 2,
5x1+2x2+x3+6x4 ≤ 15
and x1,x2,x3, x4 ≥0.
59 Find the dual of MaxZ=8x1+9x2+3x3 subject to the constraints 3.0 Medium Problem
x1+5x2+6x3 ≤ 80, (Applying/Analysing) oriented
2x1+4x2+x3 ≤ 50,
3x1+2x2+4x3 ≤ 90
and x1,x2,x3 ≥ 0.

U1-T2-S2--B4

60 Use the dual simplex method to solve the linear programming problem: Minimize 8.0 Complex(Evaluating/Creating) Problem
Z = 2x 1 + 2x 2 + 4x 3 subject to the constraints 2x 1 + 3x 2 + 5x 3 ≥ 2, 3x 1 + x 2 + 7x 3 ≤ 3, oriented
x 1 + 4x 2 + 6x 3 ≤ 5 and x 1, x 2, x 3 ≥ 0.
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

61 Using dual simplex algorithm find the solution of the linear programming problem 8.0 Medium Problem
MaxZ = 2x 3 subject to the constraints (Applying/Analysing) oriented
− x 1 + 3x 2 − 7x 3 ≥ 5, − x 1 + x 2 − x 3 ≤ 1, 3x 1 + x 2 − 10x 3 ≤ 8, x 1, x 2, x 3 ≥ 0.
62 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Medium Problem
Z = 10x 1 + 6x 2 + 2x 3 subject to the constraints − x 1 + x 2 + x 3 ≥ 1, 3x 1 + x 2 − x 3 ≥ 2 and (Applying/Analysing) oriented
x 1, x 2, x 3 ≥ 0.
63 Use the dual simplex method to solve the linear programming problem Maximize 8.0 Medium Problem
Z = − 2x 1 − x 3 subject to the constraints x 1 + x 2 − x 3 ≥ 5, x 1 − 2x 2 + 4x 3 ≥ 8 and (Applying/Analysing) oriented
x 1, x 2, x 3 ≥ 0.
64 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Complex(Evaluating/Creating) Problem
Z = 6x 1 + 7x 2 + 3x 3 + 5x 4 subject to the constraints 5x 1 + 6x 2 − 3x 3 + 4x 4 ≥ 12, oriented
x 2 + 5x 3 − 6x 4 ≥ 10, 2x 1 + 5x 2 + x 3 + x 4 ≥ 8 and x 1, x 2, x 3, x 4 ≥ 0.
65 Using dual simplex method solve the linear programming problem: Maximize Z = 3x 1 + 2x 2 8.0 Medium Problem
, subject to the constraints x 1 + x 2 ≥ 1, x 1 + x 2 ≤ 7, x 1 + 2x 2 ≤ 10, x 2 ≤ 3 and x 1, x 2 ≥ 0. (Applying/Analysing) oriented

66 Use the dual simplex method to solve the linear programming problem Maximize 8.0 Medium Problem
Z = − 3x 1 − 2x 2 subject to the constraints x 1 + x 2 ≥ 1, x 1 + x 2 ≤ 7, x 1 + 2x 2 ≥ 10, x 2 ≤ 3 (Applying/Analysing) oriented
and x 1, x 2 ≥ 0.
67 Using dual simplex method solve the linear programming problem: Maximize Z = 2x 1 + 3x 2 8.0 Simple Problem
(Remembering/Understanding) oriented
, subject to the constraints 2x 1 + 4x 2 ≥ 1, x 1 + 2x 2 ≥ 1, 2x 1 + x 2 ≥ 1 and x 1, x 2 ≥ 0.
68 Using dual simplex algorithm maximize the objective function Z = 2x 3 of a linear 8.0 Complex(Evaluating/Creating) Problem
programming problem, subject to the constraints oriented
− x 1 + 2x 2 − 2x 3 ≥ 8, − x 1 + x 2 + x 3 ≤ 4, 2x 1 − x 2 + 4x 3 ≤ 10, x 1, x 2, x 3 ≥ 0.
69 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Medium Problem
Z = 2x 1 + 3x 2 subject to the constraints 2x 1 − x 2 − x 3 ≥ 3, x 1 − x 2 + x 3 ≥ 2 and (Applying/Analysing) oriented
x 1, x 2, x 3 ≥ 0.
70 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Medium Problem
Z = x 1 + 2x 2 + 3x 3 subject to the constraints x 1 − x 2 + x 3 ≥ 4, x 1 + x 2 + 2x 3 ≤ 8, x 2 − x 3 ≥ 2 (Applying/Analysing) oriented
and x 1, x 2, x 3 ≥ 0.
71 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Complex(Evaluating/Creating) Problem
Z = 3x 1 + 2x 2 + x 3 + x 4 subject to the constraints 2x 1 + 4x 2 + 5x 3 + x 4 ≥ 10, oriented
3x 1 − x 2 + 7x 3 − 2x 4 ≤ 2, 5x 1 + 2x 2 + x 3 + 6x 4 ≤ 15 and x 1, x 2, x 3, x 4 ≥ 0.
72 Use the dual simplex method to solve the linear programming problem Maximize 8.0 Medium Problem
Z = 2x 1 + 2x 2 subject to the constraints x 1 + 2x 2 ≥ 1, 2x 1 + x 2 ≥ 1 and x 1, x 2 ≥ 0. (Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

73 Using dual simplex algorithm solve the linear programming problem MinZ = − x 1 + x 2 8.0 Medium Problem
subject to the constraints x 1 − 4x 2 ≥ 5, x 1 − 3x 2 ≤ 1, 2x 1 − 5x 2 ≥ 1, x 1, x 2 ≥ 0. (Applying/Analysing) oriented

74 Using dual simplex method solve the linear programming problem: Maximize Z = 4x 1 + 2x 2 8.0 Simple Problem
, subject to the constraints x 1 + x 2 ≥ 3, x 1 − x 2 ≤ 2 and x 1, x 2 ≥ 0. (Remembering/Understanding) oriented

75 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Medium Problem
Z = 2x 1 + 2x 2 + 4x 3 subject to the constraints 2x 1 + 3x 2 + 5x 3 ≥ 2, 3x 1 + x 2 − 7x 3 ≤ 3, (Applying/Analysing) oriented
x 1 + 4x 2 − 6x 3 ≤ 5 and x 1, x 2, x 3 ≥ 0.
76 Use the dual simplex method to solve the linear programming problem Minimize 8.0 Medium Problem
Z = 2x 1 + x 2 subject to the constraints 3x 1 + x 2 ≥ 3, 4x 1 + 3x 2 ≥ 6, x 1 + 2x 2 ≥ 3and (Applying/Analysing) oriented
x 1, x 2 ≥ 0.
77 Using the dual simplex algorithm, Minimize Z = 2x 1 + x 2 subject to the constraints 8.0 Simple Problem
3x 1 + x 2 ≥ 3, 4x 1 + 3x 2 ≥ 6, x 1 + 2x 2 ≥ 3 and x 1, x 2 ≥ 0. (Remembering/Understanding) oriented

78 Using dual simplex algorithm solve the linear programming problem MinZ = 3x 1 + 2x 2 + x 3 8.0 Medium Problem
subject to the constraints (Applying/Analysing) oriented
3x 1 + x 2 + x 3 ≥ 3, − 3x 1 + 3x 2 + x 3 ≥ 6, x 1 + x 2 + x 3 ≤ 3, x 1, x 2, x 3 ≥ 0.
79 Use the dual simplex method to solve the linear programming problem Maximize 8.0 Medium Problem
Z = 3x 1 + x 2 subject to the constraints x 1 + x 2 ≥ 1, 2x 1 + 3x 2 ≥ 2 and x 1, x 2 ≥ 0. (Applying/Analysing) oriented
80 Use the dual simplex method to solve the linear programming problem Maximize 8.0 Medium Problem
Z = − 4x 1 − 6x 2 − 18x 3 subject to the constraints x 1 + 3x 3 ≥ 3, x 2 + 2x 3 ≥ 5 and (Applying/Analysing) oriented
x 1, x 2, x 3 ≥ 0.
81 Using the dual simplex algorithm, Minimize Z = 2x 1 + x 2 subject to the constraints 8.0 Simple Problem
3x 1 + x 2 ≥ 3, 4x 1 + 3x 2 ≥ 6, x 1 + 2x 2 ≤ 3 and x 1, x 2 ≥ 0. (Remembering/Understanding) oriented

U1-T3-S1--A4

82 Using the North-West corner rule, obtain the initial basic feasible solution for the 3.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Warehouse
W1 W2 W3 Supply
F1 5 7 8 70
Factory F2 4 4 6 30
F3 6 7 7 50
Demand 65 42 43 150
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

83 Using the North-West corner rule, obtain the initial basic feasible solution for the 3.0 Complex(Evaluating/Creating) Problem
transportation problem given by oriented
Destination
D1 D2 D3 D4 Supply
O1 3 1 7 4 300
Source O2 2 6 5 9 400
O3 8 3 3 2 500
Demand 250 350 400 200 1200
84 Using the North-West corner rule, obtain the initial basic feasible solution for the 3.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Warehouse
W1 W2 W3 Supply
F1 16 20 12 200
Factory F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150 350
85 What is the necessary and sufficient condition for the existence of a feasible solution to 3.0 Simple Problem
a transportation problem? Give any two terminologies associated with this condition. (Remembering/Understanding) oriented

U1-T3-S2--B5

86 Using Vogel's approximation method, find the initial basic feasible solution of the 8.0 Simple Problem
transportation problem given by (Remembering/Understanding) oriented
Distribution Centre
I II III IV Supply
A 8 12 44 28 18
Factory B 4 0 24 4 3
C 20 32 60 36 30
Demand 21 15 9 6 51
87 Using Vogel's approximation method, obtain the initial basic feasible solution of the 8.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Project Location
I II III IV Availability
Terminal A 20 36 19 28 10
B 40 20 45 20 4
C 75 35 45 50 6
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

D 30 35 40 25 5
Requirement 13 10 6 6
88 Using Vogel's approximation method, obtain the initial basic feasible solution of the 8.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Stores
I II III IV Supply
A 7 3 5 5 34
B 5 5 7 6 15
Warehouse
C 8 6 6 5 12
D 6 1 6 4 19
Demand 21 25 17 17 80
89 Using Vogel's approximation method, determine the initial basic feasible solution of the 8.0 Complex(Evaluating/Creating) Problem
transportation problem given by oriented
Retail Outlets
A B C D E Supply
X 55 30 40 50 50 40
Distribution
Y 35 30 100 45 60 20
Centre
Z 40 60 95 35 30 40
Demand 25 10 20 30 15 100
90 Using Vogel's approximation method, determine the initial basic feasible solution of the 8.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Destination
D1 D2 D3 D4 Availability
O1 1 2 1 4 20
O2 3 3 2 1 40
Origin
O3 4 2 5 9 20
O4 5 3 6 10 20
Requirement 20 40 30 10
91 Using Vogel's approximation method, determine the initial basic feasible solution of the 8.0 Medium Problem
transportation problem given by (Applying/Analysing) oriented
Destination
A B C D E Supply
X 2 11 10 3 7 4
Origin Y 1 4 7 2 1 8
Z 3 9 4 8 12 9
Demand 3 3 4 5 6
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

U1-T3-S3--C1

92 Find the initial basic feasible solution by using the lowest cost entry method and hence 10.0 Simple Problem
solve the transportation problem given by (Remembering/Understanding) oriented
Destination
I II III Supply
A 6 11 8 100
B 7 3 5 200
C 5 4 3 450
Source D 4 5 6 400
E 8 4 5 200
F 6 3 8 350
G 5 2 4 300
Demand 600 400 1000
93 Obtain the initial basic feasible solution by using the lowest cost entry method and hence 10.0 Medium Problem
solve the transportation problem given by (Applying/Analysing) oriented
Destination
I II III IV V VI Supply
A 6 9 7 14 9 21 30
Source B 20 8 7 6 11 18 25
C 8 6 14 9 7 8 42
Demand 15 15 12 30 10 15
94 Obtain the initial basic feasible solution by using the lowest cost entry method and hence 10.0 Medium Problem
solve the transportation problem given by (Applying/Analysing) oriented
Destination
I II III IV Supply
A 11 13 17 14 250
Source B 16 18 14 10 300
C 21 24 13 10 400
Demand 200 225 275 250
95 Determine the initial basic feasible solution by using the lowest cost entry method and 10.0 Complex(Evaluating/Creating) Problem
hence solve the transportation problem given by oriented
Destination
I II III IV V Supply
Source A 40 36 26 38 30 160
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

B 38 28 34 34 198 280
C 36 38 24 28 30 240
Demand 160 160 200 120 240
96 A company is spending Rs. 1000 on the transportation of its units from three plants to four 10.0 Complex(Evaluating/Creating) Problem
distribution centers. The supply and demand of units, with the unit cost of transportation, oriented
are given as :
Distribution Centres
Availability
Plants D1 D2 D3 D4
P1 19 30 50 12 7
P2 70 30 40 60 10
P3 40 10 60 20 18
Requirement 5 8 7 15
What can be the maximum saving by optimum scheduling?
97 A firm manufacturing a single product in three plants I, II and III. They have produced 60, 10.0 Complex(Evaluating/Creating) Problem
35 and 40 units respectively during this month. The firm had made a commitment to sell 32 oriented
units to customer A, 45 units to customer B, 30 units to customer C, 28 units to customer
D. The net unit cost(in Rs.) of transportation from the three plants to the four customers is
given below:
A B C D
I 4 1 3 4
II 2 3 2 3
II 3 5 2 4
Determine the initial basic feasible solution by using the lowest cost entry method and
hence solve the transportation problem.

U1-T4-S1--A5

98 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Districts (Applying/Analysing) oriented
A B C D E
I 11 17 8 16 20
II 9 7 2 6 15
Salesman III 13 16 15 12 16
IV 21 24 17 28 26
V 14 10 12 11 15
99 Obtain the reduced assignment matrix for the assignment model given by: 3.0 Simple Problem
Districts (Remembering/Understanding) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

A B C D
I 15 11 13 15
II 17 12 12 13
Salesman
III 14 15 10 14
IV 16 13 11 17
100 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
A B C D
I 10 12 14 18
II 13 13 17 10
Man
III 11 8 7 16
IV 17 16 11 9
101 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Persons (Applying/Analysing) oriented
A B C D E
I 32 38 40 28 40
II 40 24 28 21 36
Jobs III 41 27 33 30 37
IV 22 38 41 36 36
V 29 33 40 35 39
102 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
A B C D
I 24 30 36 48
II 33 33 45 24
Man
III 27 18 15 42
IV 45 42 27 21
103 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
A B C D
I 8 26 17 11
II 13 28 4 26
Man
III 38 19 18 15
IV 19 26 24 10
104 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

A B C D
I 8 10 12 16
II 11 11 15 8
Man
III 9 6 5 14
IV 15 14 9 7
105 Obtain the reduced assignment matrix for the assignment model given by 3.0 Complex(Evaluating/Creating) Problem
Machines oriented
A B C D E
I 15 12 13 12 14
II 12 10 11 13 13
Jobs III 15 16 17 18 15
IV 12 14 13 14 11
V 12 15 14 13 12
106 Obtain the reduced assignment matrix for the assignment model given by 3.0 Complex(Evaluating/Creating) Problem
Mechanic oriented
A B C D E
I 62 78 50 101 82
II 71 84 61 73 59
Jobs III 87 92 111 71 81
IV 48 64 87 77 80
V 0 0 0 0 0
107 Obtain the reduced assignment matrix for the assignment model given by 3.0 Simple Problem
Districts (Remembering/Understanding) oriented
A B C D
1 320 350 400 280
2 400 250 300 220
Salesman
3 420 270 340 300
4 250 300 410 350
108 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
A B C D
I 16 20 24 32
II 22 22 30 16
Man
III 18 12 10 28
IV 30 28 18 14
109 Obtain the reduced assignment matrix for the assignment model given by 3.0 Medium Problem
Jobs (Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

A B C D
I 16 42 34 22
II 26 56 8 52
Man
III 76 38 36 30
IV 38 32 48 20

U1-T4-S2--B6

110 Obtain the solution of the assignment problem given by 8.0 Complex(Evaluating/Creating) Problem
Jobs oriented
J1 J2 J3 J4
M1 5 3 2 8
M2 7 9 2 6
Men
M3 6 4 5 7
M4 5 7 7 8
Give the alternative optima, if exists.
111 Obtain the solution of the assignment problem given by 8.0 Medium Problem
Manufacturing Setups (Applying/Analysing) oriented
S1 S2 S3 S4 S5
B1 4 6 7 5 11
B2 7 3 6 9 5
Brands B3 8 5 4 6 9
B4 9 12 7 11 10
B5 7 5 9 8 11
Give the alternative solution, if exists.
112 Solve the assignment problem given by 8.0 Simple Problem
Jobs (Remembering/Understanding) oriented
J1 J2 J3 J4 J5
M1 7 5 9 8 11
M2 9 12 7 11 10
Machine M3 8 5 4 6 9
M4 7 3 6 9 5
M5 4 6 7 5 11
113 Minimize the cost of assigning in the assignment problem given by 8.0 Medium Problem
Jobs (Applying/Analysing) oriented
J1 J2 J3 J4 J5
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

M1 85 75 65 125 75
M2 90 78 66 132 78
Machine M3 75 66 57 114 69
M4 80 72 60 120 72
M5 76 64 56 112 68
114 Find the optimal solution to the assignment problem with the following cost matrix. 8.0 Simple Problem
Project Give the alternative optima, if exists. (Remembering/Understanding) oriented
A B C D
I 18 24 28 32
Machine II 8 13 17 19
III 10 15 19 22
115 Obtain the solution to the assignment problem given by 8.0 Medium Problem
Jobs Give the alternative optima, if exists. (Applying/Analysing) oriented
J1 J2 J3
M1 9 12 11
M2 8 13 17
Men
M3 20 12 13
M4 21 15 17

U2--Queuing Theory and Game Theory

U2-T1-S1--A6

116 Identify the customer and the server of the queues from the situations (a) Planes 3.0 Medium Problem
arriving at an airport (b) Taxi stand serving waiting passengers and (c) Parking lot (Applying/Analysing) oriented
operation.
117 What is meant by pure birth model in queuing theory? Give an example. 3.0 Simple Problem
(Remembering/Understanding) oriented
118 Give the role of the exponential distribution in queuing theory. 3.0 Complex(Evaluating/Creating) Problem
oriented
119 What is meant by pure death model in queuing theory? Give an example. 3.0 Medium Problem
(Applying/Analysing) oriented

U2-T1-S2--B7

120 Babies are born in a sparsely populated state at the rate of one birth every 12 minutes. 8.0 Simple Problem
The time between births follows an exponential distribution. Find the following: (i) (Remembering/Understanding) oriented
The average number of births per year. (ii) The probability that no births will occur in
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

any one day. (iii) The probability of issuing 50 birth certificates in 3 hours given that
40 certificates were issued during the first 2 hours of the 3-hour period.
121 The florist section in a grocery store stocks 18 dozen roses at the beginning of each 8.0 Complex(Evaluating/Creating) Problem
week. On the average, the florist sells 3 dozens a day (one dozen at a time), but the oriented
actual demand follows a Poisson distribution. Whenever the stock level reaches 5
dozens, a new order of 18 new dozens is placed for delivery at the beginning of the
following week. Because of the nature of the item, all roses left at the end of the week
are disposed. Determine the following: (i) the probability of placing an order in any
one day of the week. (ii) the probability of placing an order on the seventh day of the
week, if computationally the probability of no roses discarded on the seventh day of a
week is 0.7730.
122 Derive the steady state probabilities for the Pure Birth Model. 8.0 Medium Problem
(Applying/Analysing) oriented
123 Derive the steady state probabilities for Pure Death Model. 8.0 Medium Problem
(Applying/Analysing) oriented

U2-T2-S1--A7

124 Explain the components given in the type of queue expressed by the notation 3.0 Complex(Evaluating/Creating) Problem
(M / M / c) : (GD / N / ∞). oriented
125 Explain the components given in the type of queue expressed by the notation 3.0 Simple Problem
(M / M / 1) : (GD / N / ∞). (Remembering/Understanding) oriented
126 Identify the components given in the type of queue expressed by the notation 3.0 Medium Problem
(M / M / 1) : (GD / ∞ / ∞). (Applying/Analysing) oriented
127 Identify the components given in the type of queue expressed by the notation 3.0 Medium Problem
(M / M / ∞) : (GD / ∞ / ∞). (Applying/Analysing) oriented
128 Explain the components given in the type of queue expressed by the notation 3.0 Medium Problem
(M / M / c) : (GD / ∞ / ∞). (Applying/Analysing) oriented
129 Explain the components given in the type of queue expressed by the notation 3.0 Medium Problem
(M / M / c) : (GD / ∞ / ∞). (Applying/Analysing) oriented

U2-T2-S2--B8

130 Consider a single server queuing system with Poisson inputs and exponential service 8.0 Medium Problem
time. Suppose the mean arrival rate is 3 calling units per hour and the expected service (Applying/Analysing) oriented
time is 0.25 hours and the maximum permissible calling units in the system is two.
1. Calculate the expected no of customers in the system.
2. Calculate the expected queue length.
3. Expected waiting time of the customer in the system?
131 A self-service store employs one cashier at its counter. Nine customers arrive on 8.0 Simple Problem
average every 5 minutes while the cashier can serve 10 customers in 5 minutes. (Remembering/Understanding) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

Assuming Poisson distribution for arrival rate and exponential distribution for service
time, find
1. Average (or expected) no of customers in the system.
2. Average no of customers in the queue.
3. Average time a customer spends in the system.
4. Average time a customer waits before being served.
132 Arrival and service at the bakery shop follow Poisson and exponential distribution. A 8.0 Simple Problem
single salesman can attend to customers at an average rate of 14/hrs and customers (Remembering/Understanding) oriented
arrive at 12/hrs. Find
1. Average (or expected) no of customers in the system.
2. Average no of customers in the queue.
3. Probability that there are 3 customers in the system
4. Average length of the non-empty queue
133 Trains arrive at the yard every 15 minutes and the service time is 33 minutes. The line 8.0 Complex(Evaluating/Creating) Problem
capacity of the yard is limited to 4 trains. Find oriented
(1) the probability that the yard is empty.
(2) the average no of trains in the system.
134 Derive the steady state probabilities for the model (M / M / 1) : (GD / N / ∞) and hence 8.0 Medium Problem
find the expected waiting times, lengths in the system and the queue. (Applying/Analysing) oriented
135 A tax consulting firm has 3 counters in its office to receive people who have problems 8.0 Medium Problem
concerning their income, wealth, and sales taxes. On the average 48 persons arrive in (Applying/Analysing) oriented
an 8-hour day. Each tax adviser spends 15 minutes on an average on an arrival. If the
arrivals are Poisson distributed and service times are according to an exponential
distribution, find
(a) the average number of customers in the system,
(b) the average number of customers waiting to be served,
(c) the average time a customer spends in the system.
136 A supermarket has two girls ringing up sales at the counters. If the service time from 8.0 Complex(Evaluating/Creating) Problem
each customer is exponential with a mean of 4 minutes, and if people arrive in a oriented
Poisson fashion at the rate of 10 an hour, find
(a) the average number of customers in the system,
(b) the average number of customers waiting to be served,
(c) the average time a customer spends in the system.
137 A community is served by two cab companies. Each company owns two cabs, and 8.0 Medium Problem
both share the market equally, with calls arriving at each company’s dispatching office (Applying/Analysing) oriented
at the average rate of eight per hour. The average time per ride is 12 minutes. Calls
arrive according to a Poisson distribution, and the ride time is exponential. Find
(a) the average number of customers in the system,
(b) the average number of customers waiting to be served,
(c) the average time a customer spends in the system.
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

138 Derive the steady state probability for the model (M / M / 1) : (GD / ∞ / ∞) and hence find 8.0 Medium Problem
the expected waiting times, lengths in the system and the queue. (Applying/Analysing) oriented
139 A community is served by two cab companies. Each company owns two cabs and both 8.0 Medium Problem
shares the market equally, as evidenced by the fact that calls arrive at each company’s (Applying/Analysing) oriented
dispatching office at the rate of eight per hour. The average time per ride is 12
minutes. Calls arrive according to a Poisson distribution, and the ride time is
exponential. The two companies recently were bought by an investor who
consolidated them into a single dispatching office to provide better service to
customers. Suppose that new funds cannot be secured to purchase additional cabs. The
owner was advised by a consultant that one way to reduce the waiting time is for the
dispatching office to inform new customers of potential excessive delay once the
waiting list reaches 6 customers. This move is certain to get new customers to seek
service elsewhere but will reduce the waiting time for those on the waiting list. Find
(i) the expected number of idle cabs.
(ii) Average no of customers in the queue.

U2-T3-S1--A8

140 Explain the notion of pure strategy by giving an example. 3.0 Complex(Evaluating/Creating) Problem
oriented
141 What is meant by strategy for a player in a game? Give the two types of strategies. 3.0 Simple Problem
(Remembering/Understanding) oriented
142 Illustrate the notion of two-person zero sum game with two examples. 3.0 Medium Problem
(Applying/Analysing) oriented
143 Illustrate the notion of mixed strategy with two examples. 3.0 Medium Problem
(Applying/Analysing) oriented

U2-T3-S2--A9

144 Find the saddle point solution, the associated pure strategies, and the value of the 3.0 Simple Problem
game (Remembering/Understanding) oriented
Player B
B1 B2 B3 B4
Player A
A1 0 0 0

A2 1

A3 1
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

A4 1

A5 1

where, the payoffs are for player A.

145 Obtain the saddle point solution, the associated pure strategies, and the value of the 3.0 Medium Problem
game (Applying/Analysing) oriented
Player B
B1 B2 B3 B4
A1 4 -4 -5 6
A2 -3 -4 -9 -2
Player A
A3 8 7 -8 -9
A4 7 3 -9 5
where, the payoffs are for player A.
146 For what value of k, the given game is strictly determinable? 3.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3
A1 k 6 2
Player A A2 -1 k -7
A3 -2 4 k
147 For what values of p and q, the given game is strictly deterministic? 3.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3
A1 2 4 5
Player A A2 10 7 q
A3 4 p 6
148 Obtain the saddle point solution, the associated pure strategies, and the value of the 3.0 Medium Problem
game (Applying/Analysing) oriented
Player B
B1 B2 B3 B4
A1 8 6 2 8
Player A A2 8 9 4 5
A3 7 5 3 5
where, the payoffs are for player A.
149 Determine the saddle point solution, the associated pure strategies, and the value of 3.0 Complex(Evaluating/Creating) Problem
the game oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

Player B
B1 B2 B3 B4
A1 8 -2 9 -3
Player A A2 6 5 6 8
A3 -2 4 -9 5
where, the payoffs are for player A.

U2-T4-S1--B10

150 If player A is the maximizing player and player B is the minimizing player, then by 3.0 Medium Problem
using the principles of dominance solve the game given by (Applying/Analysing) oriented
Player B
B1 B2 B3 B4
A1 3 5 4 2
A2 5 6 2 4
Player A
A3 2 1 4 0
A4 3 3 5 2
151 If player A is the maximizing player and player B is the minimizing player, then by 8.0 Medium Problem
using the principles of dominance solve the game given by (Applying/Analysing) oriented
Player B
B1 B2 B3 B4
A1 3 2 4 0
A2 3 4 2 4
Player A
A3 4 2 4 0
A4 0 4 0 8
152 If player A is the maximizing player and player B is the minimizing player, then by 8.0 Complex(Evaluating/Creating) Problem
using the principles of dominance solve the game given by oriented
Player A
A1 A2 A3 A4 A5
B1 4 6 5 10 6
B2 7 8 5 9 10
Player B
B3 8 9 11 10 9
B4 6 4 10 6 4
153 If player A is the maximizing player and player B is the minimizing player, then by 8.0 Medium Problem
using the principles of dominance solve the game given by (Applying/Analysing) oriented
Player A
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

A1 A2 A3 A4 A5
B1 4 4 4 4 4
B2 2 3 3 3 3
B3 0 1 7 4 3
Player B
B4 2 3 -5 -1 -2
B5 1 2 1 2 2
B6 1 2 2 2 2
154 Using the principle of dominance method, solve the game given by the matrix 8.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3 B4
A1 21 8 9 7
A2 9 5 16 8
Player A
A3 14 10 20 6
A4 10 9 15 1
155 Using the principle of dominance method, solve the game given by the matrix 8.0 Simple Problem
Player B (Remembering/Understanding) oriented
B1 B2 B3 B4 B5
A1 2 4 3 8 4
A2 5 6 3 7 8
Player A
A3 6 7 9 8 7
A4 4 2 8 4 3

U2-T4-S2--B11

156 Using the graphical method, determine the solution of the game given by 8.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3
A1 1 3 11
Player A
A2 8 5 2
157 Using graphical method, find the solution of the game given by 8.0 Simple Problem
Player B (Remembering/Understanding) oriented
B1 B2
A1 5 8
Player A A2 6 5
A3 5 7
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

158 Using graphical method solve the game for the pay-off matrix 8.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3 B4
A1 -6 0 6 -3
Player A
A2 7 -3 8 2
159 Using graphical method, find the solution of the game given by 8.0 Complex(Evaluating/Creating) Problem
Player B oriented
B1 B2
A1 -5 3
A2 -2 5
Player A A3 0 -2
A4 -3 0
A5 1 -4

160 Using graphical method solve the game for the pay-off matrix 8.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3 B4
A1 3 1 -3 7
Player A
A2 7 2 4 -6
161 Using graphical method solve the game for the pay-off matrix 8.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3 B4
A1 2 2 3 -1
Player A
A2 4 3 2 6

U2-T4-S3--C2

162 Formulate the LPP through the view point of both the players, for the two person zero 10.0 Complex(Evaluating/Creating) Problem
sum game oriented
Player B
B1 B2 B3
A1 5 4 7
Player A A2 5 8 4
A3 8 5 6
and hence solve the game by choosing the appropriate formulation of LPP.
163 Solve the two person zero sum game by linear programming: 10.0 Medium Problem
(Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

Player B
B1 B2 B3
A1 3 -1 -3
Player A A2 -2 4 -1
A3 -5 -6 2
164 Consider a two-person zero-sum game given by: 10.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3
A1 1 -2 1
Player A A2 -1 3 -2
A3 -1 -2 3
Formulate this game as a linear programming problem and then solve for the optimum
strategies for the two players and the value of the game.
165 Solve the two person zero sum game by linear programming: 10.0 Medium Problem
Player B (Applying/Analysing) oriented
B1 B2 B3
A1 3 0 3
Player A A2 1 5 0
A3 1 0 5
166 Find the solution of the two person zero sum game by linear programming: 10.0 Simple Problem
Player B (Remembering/Understanding) oriented
B1 B2 B3
A1 3 -1 4
Player A
A2 6 7 -2

U3--Network Models

U3-T1-S1--B12

167 Explain the linear programming Model of any Shortest Route Problem and hence give the 8.0 Simple Problem
LPP of the Shortest Route Problem from node 1 to node 2 of the network given by (Remembering/Understanding) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

168 Analyze and explain the linear programming Model of any Shortest Route Problem and 8.0 Medium Problem
hence give the LPP of the Shortest Route Problem from node 4 to node 3 of the network (Applying/Analysing) oriented
given by

169 Explain the linear programming Model of any Shortest Route Problem and hence give the 8.0 Medium Problem
linear programming formulation of the Shortest Route Problem from node A to node E of the (Applying/Analysing) oriented
network given by

170 Analyze and explain the linear programming Model of any Shortest Route Problem and 8.0 Medium Problem
hence give the LPP of the Shortest Route Problem from node 2 to node 5 of the network (Applying/Analysing) oriented
given by
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

171 Explain the linear programming Model of any Shortest Route Problem and hence give the 8.0 Medium Problem
linear programming formulation of the Shortest Route Problem from node 1 to node 7 of the (Applying/Analysing) oriented
network given by

172 Explain the linear programming Model of any Shortest Route Problem and hence give the 8.0 Complex(Evaluating/Creating) Problem
LPP of the Shortest Route Problem from node 1 to node 5 of the network given by oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

U3-T2-S1--A10

173 Give the meaning of maximal flow in a network? If the cut 1 has the capacity 60, cut 3.0 Complex(Evaluating/Creating) Problem
2 has the capacity 110 and the cut 3 has a capacity 70 in a network, determine is the oriented
maximal flow?
174 Illustrate the notion of cut capacity in the study of Maximal Flow Model with a 3.0 Medium Problem
example. (Applying/Analysing) oriented
175 Given the arc (i, j) in the network with i < j , then what does the notation (C
ˉ , Cˉ ) 3.0 Simple Problem
ij ji
(Remembering/Understanding) oriented
represent in a network?
176 Illustrate the notion of cut in the study of Maximal Flow Model with an example. 3.0 Medium Problem
(Applying/Analysing) oriented

U3-T2-S2--C3

177 Using the maximal flow algorithm, find the maximal flow in the network given by 10.0 Simple Problem
(Remembering/Understanding) oriented

Also, determine the amount of flow through nodes 2, 3, and 4.

178 Using the maximal flow algorithm obtain the maximal flow in the network given by 10.0 Medium Problem
(Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

179 Using the maximal flow algorithm determine the maximal flow in the network given by 10.0 Complex(Evaluating/Creating) Problem
oriented

180 Using the maximal flow algorithm obtain the maximal flow in the network given by 10.0 Medium Problem
(Applying/Analysing) oriented

Also determine the amount of flow through nodes 2, 4 and 5.

U3-T3-S1--A11

181 Give the algorithm for computing the Earliest Occurrence Times in a project 3.0 Simple Problem
network. (Remembering/Understanding) oriented
182 Expand the acronym CPM. Under what circumstances an activity in a project network 3.0 Medium Problem
is critical? (Applying/Analysing) oriented
183 What is the meant by (i) Earliest occurrence time of an event (ii) Latest occurrence 3.0 Medium Problem
time of an event? (Applying/Analysing) oriented
184 Give the three rules available for representing a project as a network. 3.0 Medium Problem
(Applying/Analysing) oriented
185 Give the algorithm for computing the Latest Occurrence Times in a project network. 3.0 Complex(Evaluating/Creating) Problem
oriented
186 Expand the acronym CPM. Under what circumstances an activity in a project network 3.0 Medium Problem
is non-critical? (Applying/Analysing) oriented
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

U3-T3-S2--A12

187 When a, m and b are optimistic, most likely and pessimistic times respectively of an 3.0 Medium Problem
activity in a PERT network, give the formula for finding the approximate average (Applying/Analysing) oriented
duration time (t) and the variance (σ). Further find t and σ, when (a, m, b ) is (1, 4, 7).
188 Expand the acronym PERT. Give the terminology used for the time which occurs 3.0 Medium Problem
when execution goes extremely poorly? (Applying/Analysing) oriented
189 When a, m and b are optimistic, most likely and pessimistic times respectively of an 3.0 Medium Problem
activity in a PERT network, give the formula for finding the approximate average (Applying/Analysing) oriented
duration time (t) and the variance (σ). Further find t and σ, when (a, m, b ) is (11, 17,
23).
190 What does the acronym PERT stand for? What is the terminology used for the time 3.0 Simple Problem
which occurs when execution goes extremely well? (Remembering/Understanding) oriented
191 When a, m and b are optimistic, most likely and pessimistic times respectively of an 3.0 Complex(Evaluating/Creating) Problem
activity in a PERT network, calculate the approximate average duration time and the oriented
variance.
192 Expand the acronym PERT. Give the terminology used for the time which occurs 3.0 Medium Problem
when execution is under the normal conditions? (Applying/Analysing) oriented

U3-T3-S3--B13

193 Determine the critical path for the project network given by- 8.0 Complex(Evaluating/Creating) Problem
oriented

194 A project consists of the following activities, whose time estimates are given against each as 8.0 Medium Problem
under: (Applying/Analysing) oriented
Activity (a,m,b) Activity (a,m,b)
1–2 (3,6,15) 3–6 (3,6,15)
1–3 (2,5,14) 4–7 (3,9,27)
1–4 (6,12,30) 5–7 (1,4,7)
2-5 (2,5,8) 6–7 (4,19,28)
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

2–6 (5,11,17)
where a is the optimistic time, m is the most likely time and b is the most pessimistic time. (i)
Draw the project network (ii) Find the expected duration and variance of each activity (iii) Find
the critical path, its expected duration, and standard deviation.
195 Find the critical path of the project network given by 8.0 Medium Problem
(Applying/Analysing) oriented

196 A project consists of the following activities, whose time estimates are given against each as 8.0 Complex(Evaluating/Creating) Problem
under oriented
Activity i-j (a,m,b) Activity i-j (a,m,b)
A 1-2 (3,4,7) E 3-5 (1,2,3)
B 1-3 (4,6,8) F 3-6 (9,11,13)
C 2-3 (1,3,5) G 4-6 (1,1,1)
D 2-4 (5,8,11) H 5-6 (10,12,14)
where a is the optimistic time, m is the most likely time and b is the most pessimistic time. (i)
Draw the project network (ii) Find the expected duration and variance of each activity (iii) Find
the critical path, its expected duration and standard deviation.
197 A project consists of the following activities, whose time estimates are given against each as 8.0 Medium Problem
under (Applying/Analysing) oriented
Activity (a,m,b) Activity (a,m,b)
1–2 (5, 10, 8) 3–6 (6, 12, 9)
(18, 22,
1–3 4–7 (7, 12, 10)
20)
(26, 40,
1–4 5–7 (7, 9, 8)
33)
(16, 20,
2-5 6–7 (3, 5, 4)
18)
(15, 25,
2–6
20)
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

where a is the optimistic time, m is the most likely time and b is the most pessimistic time. (i)
Draw the project network (ii) Find the expected duration and variance of each activity (iii) Find
the critical path, its expected duration and standard deviation.
198 Obtain the critical path for the project network given by: 8.0 Medium Problem
(Applying/Analysing) oriented

199 A project consists of the following activities, whose time estimates are given against each as 8.0 Medium Problem
under (Applying/Analysing) oriented
Activity (a,m,b) Activity (a,m,b)
1–2 (5,6,8) 3–8 (3,4,5)
1–4 (1,3,4) 4–6 (4,8,10)
1–5 (2,4 5) 4–7 (5 6 8)
2–3 (4,5,6) 5–6 (9,10,15)
2–5 (7,8,10) 5–7 (4,6,8)
2–6 (8,9,13) 6–7 (3 4 5)
3-4 (5,9,19)
where a is the optimistic time, m is the most likely time and b is the most pessimistic time. (i)
Draw the project network (ii) Find the expected duration and variance of each activity (iii) Find
the critical path, its expected duration and standard deviation.
200 A project consists of the following activities, whose time estimates are given against each as 8.0 Simple Problem
under (Remembering/Understanding) oriented
Activity (a,m,b) Activity (a,m,b)
1–2 (1,3,4) 3 – 7 (12,13,14)
1–3 (5,7,8) 4 – 5 (10,12,15)
1–4 (6,7,9) 4–7 (8,10,12)
1–6 (1,2,3) 5–6 (7,8,11)
2–3 (3,4,5) 5–7 (2,4,8)
10/11/23, 1:36 AM kp.christuniversity.in/KnowledgePro/syllabuseCreation.do?method=viewQuestionsInPopup

2–5 (7,8,9) 6–7 (5,6,7)

3 – 4 (10,15,20)
where a is the optimistic time, m is the most likely time and b is the most pessimistic time. (i)
Draw the project network (ii) Find the expected duration and variance of each activity (iii) Find
the critical path, its expected duration and standard deviation.
201 Obtain the critical path for the project network given by 8.0 Medium Problem
(Applying/Analysing) oriented

202 Determine the critical path for the project network given by 8.0 Complex(Evaluating/Creating) Problem
oriented