SECTION-A

Operations Research
I BBA CA -A
1. Operation Research approach is ____
multi-disciplinary scientific
c)intuitive d)collect essential data
2. The transportation problem, for the degeneracy of the basic
solution, the number of basic cells must be ______.
3.InLPPfunctions to be maximized or minimized are called
Objective function. (True/False)
4.AsetoffeasiblesolutiontoaLinearProgrammingproblemis
convex polygon
c)triangle d)bold
5. Hungarian methos is commonly used solve assignment problem
(True/False)
6. In an assignment problem each person is assigned
exactly one job more than one job
c) exactly two job d)exactly three job
7. Zero sum games with two players are called_____
8.PERT is the ___ oriented technique
Deterministic Probabilistic c) Float d) Dummy Activity
9. C.P.M =_____
10.If the value of the game is zero then it is called a _____.
11.The linear functions which is to be minimized or maximized is
called_____
Objective function Constraints
c) Redundant constraint d) convex Polygon
12. Any feasible solution which optimizes the objective function is
called______.
13.When demand not equal to supply the transportation problem is
called _______
14.In the Transportation problem, for the degeneracy of the basic solution , the number of basic
cells must be
𝑚+𝑛 <𝑚+𝑛−1
c)> 𝑚 + 𝑛 − 1d)> 𝑚 + 𝑛
15. Assignment Problem can be solved only if 𝑚 = 𝑛
(True/False)
16. In an assignment problem each person is assigned
exactly one job more than one job
c) exactly two job d) exactly three job
17. The time between the firs and last job is called _____
18.The number of time estimates used in PERT______
0 2 c) 3 d) ∞
19.Two person zero sum game is also known as_______
20.Game without saddle point require players to play zero-sum game.
(True/ False)
21. The limitation of graphical method is
four variables three variables
 c)two variables d)None of these
22. The transportation problem, for the degeneracy of the basic
solution, the number of basic cells must be ______.
23. MODI method of obtaining an optimal solution to a transportation
problem (True/False)
24. Row wise and column wise difference between two minimum costs
is calculated under ____ method
NWCR VAM
c)LCM d)none of these
25. If the assignment problem matrix is not square then the problem is
said to be unbalanced .(True/False)
26. Each and every row and column of the assignment problem has
exactly one assigned zero the solution is
basic feasible
c)optimal d )none of these
27. PERT=_____
28.The critical activity has
Normal Float Maximum Float
c) Minimum Float d) Zero Float
29.In the value of the game is zero then it is called a ____
30.A mixed strategy game can be solved by______.

SECTION-B

1. Write the scientific methods in O.R

2. Formulation the given as an L.P.P
Product Time required in hours Profit
per
Drill Lathe Assembly unit(RS)

X 3 3 8 9

Y 6 5 10 15

Z 7 4 12 20

Hours 210 240 260

Available

3.Sove IBFS by north west corner rule.

A B C D E Supply

P 20 10 40 25 0 500

Q 45 35 60 40 50 600
 R 70 75 70 50 80 750

S 85 88 75 65 90 800

Demand 750 600 500 800 1000

4.Classify IBFS by LCM.

D E F G Supply

A 10 0 20 11 15

B 12 7 9 20 25

C 0 14 16 18 5

Demand 5 15 15 10

5..Write the algorithm of Hungarian Method

6. Solve the following assignment problem
𝑀1 𝑀2 𝑀3 𝑀4

𝐽1 5 7 11 6

𝐽2 8 5 9 6

𝐽3 4 7 10 7

𝐽4 10 4 8 3

7.What is meant by crash time and crash cost.

8. Explain the rule of network construction.
9.Find graphical solution of A 2× 2game with no saddle point

Player B
2 5
Player A [ ]
4 1
10.Define - payoff matrix, saddle point
11. Write the application of L.P.P
12. Solve by Graphical Method
Minimize 𝑍 = 2𝑥1 + 3𝑥2
Subject to 6𝑥1 + 5𝑥2 ≤ 25
𝑥1 + 3𝑥2 ≤ 10
and 𝑥1 , 𝑥2 ≥ 0

13. Sove IBFS by north west corner rule.

 D E F G Supply

A 11 13 17 14 250

B 16 18 14 10 300

C 21 24 13 10 400

Demand 200 225 275 250

14. Find IBFS by LCM.

D E F G Supply

A 2 3 11 7 6

B 1 0 6 1 1

C 5 8 15 9 10

Demand 7 5 3 2

15. Write the algorithm of Hungarian Method

16. Solve the following assignment problem

𝑀1 𝑀2 𝑀3

𝐽1 17 25 31

𝐽2 10 25 16

𝐽3 12 14 11

17. Distinguish between CPM and PERT.

18. State the objectives advantages and disadvantages

of network analysis
19. Find value of the game of A 2× 2matrix with
no saddle point
Player B
4 1
Player A [ ]
2 3

20. Define - payoff matrix, value of the game

21. Write the general form of L.P.P

22. Write the algorithm of graphical method.

23. Sove IBFS by north west corner rule.

A B C D Supply

P 6 1 9 3 70

Q 4 5 2 8 55

R 10 12 4 7 70

Demand 85 35 50 45

24. Estimate IBFS by LCM.

D E F G Supply

A 19 30 50 10 7

B 70 30 40 60 9

C 40 8 70 20 18

Demand 5 8 7 14

25. Write the algorithm of Hungarian Method.

26.Solve the following assignment problem

𝑀1 𝑀2 𝑀3 𝑀4 𝑀5

𝐽1 8 4 2 6 1

𝐽2 0 9 5 5 4

𝐽3 3 8 9 2 6

𝐽4 4 3 1 0 3

𝐽5 9 5 8 9 5

27. Describe- total float and free float.

28. Explain the following terms used in PERT
i) pessimistic time ii) optimistic time
iii) most likely time

29. Determine two-person zero sum game is pay strictly determinable and fair.

Player B
5 1
Player A [ ]
3 4
 30. Define –Strategy of game.

SECTION-C

1.Examine the necessity of OR in Industry

2. Illustrate by Graphical Method

Maximize 𝑍 = −3𝑥1 + 4𝑥2
Subject to 𝑥1 + 𝑥2 ≤ 4
2𝑥1 + 3𝑥2 ≥ 18
and 𝑥1 , 𝑥2 ≥ 0

3.Find the IBFS of following transportation problem by NWCR

and LCM
A B C D E Supply

P 7 6 4 5 9 40

Q 8 5 6 7 8 30

R 6 8 9 6 5 20

S 5 7 7 8 6 10

Demand 30 30 15 20 5

4.Illustrate by VAM method.

D E F G Supply

A 3 7 6 4 5

B 2 4 3 2 2

C 4 3 8 5 3

Demand 3 3 2 2

5.Solve the following assignment problem.

 E F G H

A 18 26 17 11

B 13 28 14 26

C 38 19 18 15

D 19 26 24 10

6.Solve the given travelling salesman problem.

E F G H I

A - 3 6 2 3

B 3 - 5 2 3

C 6 5 - 6 4

D 2 2 6 - 6

E 3 3 4 6 -

7.Construct the network for a project in which activities have the

following precedence relationship A,C,D can start immediately.

E> 𝐵, 𝐶; 𝐹, 𝐺 >; 𝐻, 𝐼 > 𝐸, 𝐹; 𝐽 > 𝐼, 𝐺; 𝐾 > 𝐻; 𝐵 > 𝐴

8.Construct the network and critical path for the following project schedule.
Activity: 1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7
Duration : 15 15 3 5 8 12 1 14 3 14
4 −4
9.Solve the game whose pay-off matrix is [ ]
−4 4

10.Solve the following game by graphical method

Player B
Player A [ -5 5 0 -1 8
8 -4 -1 6 -5]
11.Examine the necessity of OR in Industry
12. Illustrate by Graphical Method
Maximize 𝑍 = −10𝑥1 + 100𝑥2
Subject to 12𝑥1 + 6𝑥2 ≤ 3000
4𝑥1 + 10𝑥2 ≤ 2000
2𝑥1 + 3𝑥2 ≤ 900
and 𝑥1 , 𝑥2 ≥ 0
13.Find the IBFS of following transportation problem by NWCR
and LCM
A B C D E Supply

P 7 6 4 5 9 40

Q 8 5 6 7 8 30

R 6 8 9 6 5 20

S 5 7 7 8 6 10

Demand 30 30 15 20 5

14. Illustrate by VAM method.

D E F G Supply

A 15 51 42 33 23

B 80 42 26 81 44

C 90 40 66 60 33

Demand 23 31 16 30

15.Solve the following assignment problem.

I II III IV V

A 10 5 9 18 11

B 13 19 6 12 14

C 3 2 4 4 5

D 18 9 12 17 15

E 11 6 14 19 10

16.Construct the given travelling salesman problem.

 E F G H I

A - 4 7 3 4

B 4 - 6 3 4

C 7 6 - 7 5

D 3 3 7 - 7

E 4 4 5 7 -

17.Draw the network, given the following precedence relationships and also find critical
path.

Event
1 2,3 4 5 6 7
Nos:
Preceded start
1 2,3 3 4,5 5,6
by: event

18. In the following table optimistic, most likely and pessimistic times are respectively
shown against each connected activity from 10 to 100 in a project.

Activity Time Activity

Time Activity Time
10-20 4,8,12 60-100
4,6,8 40-60 3,6,9
20-40 8,12,16 80-90
2,5,8 50-80 4,8,6
40-50 0,0,0 20-30
1,4,7 70-90 4,8,12
50-70 3,6,9 30-50
3,5,7 90-100 4,10,16
4 −4
19.Solve the game whose pay-off matrix is [ ]
−4 4

20.Solve the following game by graphical method

Player B
Player A [ -5 5 0 -1 8
8 -4 -1 6 -5]
21.Examine the necessity of OR in Industry

22. Illustrate by Graphical Method

Maximize 𝑍 = 3𝑥1 + 4𝑥2
Subject to 𝑥1 + 𝑥2 ≤ 450
2𝑥1 + 𝑥2 ≤ 600
and 𝑥1 , 𝑥2 ≥ 0

23.Give the IBFS of following transportation problem by NWCR

and LCM
 1 2 3 4 Supply

A 10 0 20 11 15

B 12 7 9 20 25

C 0 14 16 18 5

Demand 5 15 15 10

24.Illustrate by VAM method.

D E F G Supply

A 3 7 6 4 5

B 2 4 3 2 2

C 4 3 8 5 3

Demand 3 3 2 2

25.Solve the following assignment problem.

I II III IV V

A 3 8 2 10 3

B 8 7 2 9 7

C 6 4 2 7 5

D 8 4 2 3 5

E 9 10 6 9 10

26.Solve the given unbalanced assignment problem.

E F G

A 9 26 15

B 13 27 6

C 35 20 15

D 18 30 20
27.Construct the network for a project in which activities have the
following precedence relationship A,C,D can start immediately.
E> 𝐵, 𝐶; 𝐹, 𝐺 >; 𝐻, 𝐼 > 𝐸, 𝐹; 𝐽 > 𝐼, 𝐺; 𝐾 > 𝐻; 𝐵 > 𝐴
28. Table below summarizes the activities of a project. Construct the network identify the
activities where slack exists:

Activity A B C D E F G
Immediate __ __ A C D B,E E,F
predecessors
Duration 10 7 5 3 2 1 14
(days)
5 2
29.Solve the game whose pay-off matrix is [ ]
3 4
30. Find the value of the value of the game
Player B
−1 2 −2
Player A [ ]
6 4 −6