Question Bank

College: HPT Arts and RYK Science college Class: S. Y. B. Sc. (Comp. Sci.)

Subject Teacher: Mr. Vinayak V. Mhaske Subject: Operations Research (MTC: 222)

A) Multiple Choice:
1. A constraint in an LP model restricts
(a) Value of objective function
(b) value of decision variable
(c) Use of the available resource
(d) All of above
2. Maximization of objective in an LP model means
(a) Value occurs at allowable set of decision
(b) Highest value of is chosen among allowable decision
(c) Neither of above
(d) Both (a) and (b)
3. Non-negative condition in LP model implies
(a) A positive coefficient of variable in objective function
(b) A positive coefficient of variables in any constraint
(c) Non-negative value of resources
(d) None of above
4. The graphical method of LPP uses
(a) Objective function equation
(b) Constraint equation
(c) Linear equation
(d) All of the above
5. A feasible solution to an LPP
(a) Must satisfy all of the constraint simultaneously
(b) Need not satisfy all the constraints, only some of them
(c) Must be corner point of the feasible region
(d) Must optimize the value of the objective function
6. Which of the following statement is true with respect to the optimal solution of
an LPP
(a) Every LPP has an optimal solution
(b) Optimal solution satieties only non-negative constraints
(c) Optimal solution satieties only objective function
(d) If an optimal solution exists, there will always be at least one at a corner
7. While solving LPP graphically, the area bounded by the constraints is called
(a) Feasible region
(b) Infeasible region
(c) Unbounded region
(d) None of above
8. If there is no common solution region for all constraints in graphical method
then LPP
(a) LPP has infeasible solution
(b) LPP has unbounded solution
(c) LPP has alternative solution
(d) None of above
9. If the value of the objective function z can be increased or decreased
indefinitely, such solution is called
(a) Bounded solution
(b) Unbounded solution
(c) Alternative Solution
(d) None of the above
10. In the standard form of LPP all constraints except non-negative constraints are
(a) Are equality type
(b) Are inequality type
(c) Are greater than or equal to type
(d) Are less than or equal to type
11. To convert ≥ inequality constraints into equality constraints, we must
(a) Add surplus variable
(b) Subtract artificial variable
(c) Subtract a surplus variable and an add artificial variable
(d) Add a surplus variable and subtract an artificial variable

12. For a maximization LPP, the objective function coefficient for an artificial variable
is
(a) +M
(b) –M
(c) Zero
(d) None of above
13. At every iteration of the simplex method, for minimization LPP, variable in the
current basis is replaced with another variable that has
(a) A positive 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 value
(b) A negative 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 value
(c) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 = 0
(d) None of the above
14. In the optimal simplex table, 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 =0 value indicates
(a) Unbounded solution
(b) Cycling
(c) Alternative solution
(d) Infeasible solution
15. For maximization LPP model, the simplex method is terminated when all the
values
 (a) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 ≤ 0
(b) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 ≥ 0
(c) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 =0
(d) 𝑍𝑍𝑗𝑗 ≤ 0
16. If all 𝑎𝑎𝑖𝑖𝑖𝑖 values in the incoming variable column of the simplex table are negative,
then
(a) Solution is unbounded
(b) There are multiple solutions
(c) There exist no solution
(d) The solution is degenerate
17. If an artificial variable is present in the ‘basic variable’ column of optimal simplex
table, then the solution is
(a) Infeasible
(b) Unbounded
(c) Degenerate
(d) No of the above
18. The per unit improvement in the solution of the minimization LP problem is
indicated by the negative of
(a) 𝐶𝐶𝑗𝑗 –𝑍𝑍𝑗𝑗 in the decision-variable column
(b) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 in the slack variable column
(c) 𝐶𝐶𝑗𝑗 -𝑍𝑍𝑗𝑗 in the surplus variable column
(d) None of the above
19. The dual of the primal maximization LP problem having m constraints and n non-
negative variables should
(a) Have n constraints and m non-negative variables
(b) Be a minimization LP problem
(c) Both (a) and (b)
(d) None of the above
20. For any primal problem and its dual,
(a) Optimal value of objective function is same
(b) Primal will have an optimal solution if and only if dual does too
(c) Both primal and dual cannot be infeasible
(d) All of the above
21. The right hand side constant of a constraint in primal problem in the
corresponding dual is
(a) A coefficient in the objective function
(b) A right-hand side constant of a constraint
(c) An input-out coefficient
(d) None of the above
22. If dual has an unbounded solution, primal has
(a) No feasible solution
(b) Unbounded solution
 (c) Feasible solution
(d) None of the above
23. If primal LPP has a finite solution then the dual LPP should have
(a) Finite solution
(b) Unbounded solution
(c) Infeasible solution
(d) None of the above
24. Dual constraints for maximization LPP can be written as
(a) ∑ 𝑎𝑎𝑖𝑖𝑖𝑖 𝑦𝑦𝑖𝑖 ≥ 𝑐𝑐𝑗𝑗
(b) ∑ 𝑎𝑎𝑗𝑗𝑗𝑗 𝑦𝑦𝑖𝑖 ≥ 𝑐𝑐𝑗𝑗
(c) ∑ 𝑎𝑎𝑖𝑖𝑖𝑖 𝑦𝑦𝑗𝑗 ≤ 𝑐𝑐𝑗𝑗
(d) ∑ 𝑎𝑎𝑗𝑗𝑗𝑗 𝑦𝑦𝑖𝑖 ≤ 𝑐𝑐𝑗𝑗
25. The initial solution of a transportation problem can be obtained by applying any
known method however, the only condition is that
(a) The solution be optimal
(b) The rim condition are satisfied
(c) The solution not be degenerate
(d) All of the above
26. The solution to a transportation problem with m-rows and n-columns is feasible
if number of positive allocations are
(a) m + n
(b) m × n
(c) m + n -1
(d) m + n + 1
27. If we were to use opportunity cost value for an unoccupied cell to test
optimality, it should be
(a) Equal to zero.
(b) Most negative number.
(c) Most positive number.
(d) All of the above.
28. During an iteration while moving from one solution to the next, degeneracy may
occur when
(a) Number of allocations from one solution to another remains same
(b) Two or more occupied cells on closed path with plus sign are tied for lowest
circled value
(c) Two or more occupied cells on closed path with minus sign are tied for
lowest circled value
(d) Either of the above
29. An alternative optimal solution to minimize transportation problem exist
whenever opportunity cost corresponding to unoccupied cell is
(a) Positive and greater than zero
(b) Positive with at least one equal to zero
 (c) Negative with at least one equal to zero
(d) None of the above
30. Which of the following method is used to verify the optimality of the current
solution of the transportation problem
(a) Least Cost method
(b) Vagel’s approximation method
(c) Modified Distributed method
(d) All of the above
31. The degeneracy in the transportation problem indicates that
(a) Dummy allocation (s) needs to be added
(b) The problem has no feasible solution
(c) The multiple optimal solution exist
(d) (a) and (b) but not (c)
32. An assignment problem is considered as a particular case of a transportation
problem because
(a) The number of rows not equal to number of columns
(b) All 𝑥𝑥𝑖𝑖𝑖𝑖 =0 or 1
(c) All supply and demands are 1
(d) (b) and (c) but not (a)
33. The purpose of a dummy row or dummy column in an assignment problem is
(a) Obtain balanced assignment problem
(b) Obtain unbalanced assignment problem
(c) Obtain optimal solution
(d) None of the above
34. The method used for solving an assignment is called
(a) NWC method
(b) MODI method
(c) Hungarian method
(d) None of the above
35. Maximization assignment problem is transferred into minimization problem by
(a) Adding each entry in a column from the maximum value in that column
(b) Subtracting each entry in a column from the maximum value in that column
(c) Subtracting each entry in the table from the maximum value in that table
(d) Any one of the above
36. If there were n workers and n jobs there would be
(a) n! solutions
(b) (n-1)! Solutions
n
(c) (n!) solutions
(d) n solutions
37. An optimal solution of an assignment problem can be obtained if
(a) Each row and each column has only one assignment
(b) Each row and each column has more than one assignment
 (c) Each row and each column has at least one assignment
(d) None of the above
38. Two person zero sum game means that the
(a) Sum of loss of one player is equal to sum of gains to other
(b) Sum of loss of one player is not equal to sum of gains to other
(c) Both (a) and (b)
(d) None of the above
39. A game is said to be fair if
(a) Maximin and minimax values are same and equal to zero
(b) Maximin and minimax values are not same
(c) Maximin value is more than minimax values
(d) None of above
40. What happens when maximin and minimax values of the game are same?
(a) No solution exist
(b) Solution is mixed
(c) Saddle point exist
(d) None of the above
41. Game theory models are classified by the
(a) Number of players
(b) Sum of all payoffs
(c) Number of strategies
(d) All of the above
42. A mixed strategy game can be solved by
(a) Algebraic method
(b) Sub-game method
(c) Graphical method
(d) All of the above
43. The size of the payoff matrix of game can be reduced by using the
(a) Game inversion
(b) Algebraic method
(c) Dominance principle
(d) Game transpose
44. In a pure strategy game
(a) Any strategy may be selected arbitrarily
(b) Only one particular course of action is used during every play
(c) Both (a) and (b)
(d) None of the above
45. If there are n-players and sum of the game is zero is called
(a) 2- person zero sum game
(b) n-person zero sum game
(c) 2 × 4 game
(d) None of the above
B) True or false:
1. Every LPP includes objective function which relates variable in the problem to
the goal of firm and constraints which represents the limit on resource available
to the firm.
2. The two objective functions (Maximize Z= 5X +7Y, and Minimize Z=-5X-7Y) will
produce the same solution to a linear programming problem.
3. Every LPP consists of decision variables, constraints and objective function but
not non-negative constraints.
4. Linear programming models have an objective function to be maximized but not
minimized.
5. A slack variable is added to a ≥ constraint in order to create equality, and
represents a quantity of unused resource.
6. Surplus variables, like slack variables, carry a zero cost in objective function.
7. The constraint 5x1 + 6x2 ≥ 30, when converted to an = constraint for use in the
simplex algorithm, will be 5x1 + 6x2 –S + A =30.
8. If the objective function coefficient in the 𝑐𝑐𝑗𝑗 row above artificial variable is –M,
then the problem is a minimization problem.
9. An optimal solution to the maximized LP problem is reached if all 𝑐𝑐𝑗𝑗 - 𝑧𝑧𝑗𝑗 ≥ 0.
10. When the optimal solution is found, all slack and surplus variables have a value
of zero.
11. The problem has infeasible solution if the value of at least one artificial variable
present in the basis is positive and the optimality condition is satisfied.
12. The dual of dual is again dual LP problem.
13. The value in the 𝑐𝑐𝑗𝑗 - 𝑧𝑧𝑗𝑗 row under columns of slack/surplus variables ignoring
negative signs do not give the direct optimal value of the dual/primal basic
variables.
14. The right hand side coefficient of some constraint in a primal LP problem
appears in the corresponding dual as a coefficient in the objective function.
15. If the ith primal constraint is of equality type, then the ith dual variable will be
unrestricted in sign and vice versa.
16. A dual variable is not defined for each constraint in the primal LP problem.
17. In a transportation problem, number of sources must be same as number of
destinations.
18. A dummy row or column is introduced in the transportation problem to convert
unbalanced into balanced transportation problem.
19. A solution to the cost minimization transportation problem is optimal when all
unoccupied cells have an opportunity cost ( 𝑑𝑑𝑖𝑖𝑖𝑖 ) which is non-positive.
20. If 𝑑𝑑𝑖𝑖𝑖𝑖 = 0, for an unoccupied cell in an optimal solution then an alternative
optimal solution exist for given transportation problem.
21. NWC method is preferred over LCM and VAM to find initial basic feasible
solution.
 22. For given transportation problem at any stage of the feasible solution, the
number of positive allocations equal to m+n-1, where m is number of rows and n
number of columns, then solution is said to be degenerate.
23. In balanced assignment problem numbers of rows are not equal to numbers of
columns.
24. All dummy rows or columns in the assignment problem are assumed to be non-
zero assignment cost.
25. Assignment problem deals with assignment of persons to jobs that they can
perform with varying efficiency.
26. In assignment problem, solution is said to be optimal if number of assignments
are less than number of rows/columns.
27. Multiple zeros in columns and rows are all indicative of multiple optimal
solutions.
28. In a two person zero-sum game, a saddle point always exists.
29. In a pure strategy game, each player always plays just one strategy.
30. If there are only two strategies, the payoff matrix has a saddle point.
31. The value of the game is the expected outcome per play when players
follow their optimal strategy.
32. A game said to be strictly determinable if lower and upper values of the game
are equal.
33. The graphical method is used to determine the probability of game using
different strategies by both the players.
34. The algebraic method is used to find optimal for each player in apayoff matrix of
size 2 × 2 without saddle point.

C) Short answer question:

1. Define LPP in the mathematical form.
2. Define following terms of LPP: i] Basic solution, ii] feasible solution, iii] Optimal
solution.
3. Define unbounded solution and infeasible solution.
4. Write any two applications of LPP.
5. Draw the feasible region bounded by the lines for the following LPP:
Maximize Z= 3x+2y; subject to x-y≤1, x+y≥3; x,y≥0.
6. Find the graphical solution of following LPP if it is exist:
Maximize Z= 3x1+5x2; subject to x1 + x2 ≤ 2, 2x1 +x2 ≥3; x1, x2 ≥0.
7. Draw the feasible region for the following constraints :
5x –y ≥0, x+y=6; x,y≥0.
8. Draw the graph and highlight the feasible region for the given constraints
3x + y ≤ 6, x + 2y = 4.
9. Draw a feasible region for the following constraints: 4x1 + x2 ≤ 6, x1 + 3x2 ≤ 9,
x1, x2 ≥ 0.
10. Show feasible region of the following LPP by graphically. Maximize (z) = x1 + x2
Subject to 2x1 + x2 ≤ 10, 2x1 + x2 = 10, x1, x2 ≥ 0.

11. Define surplus variables and slack variables

12. What is the artificial variable?
13. What is the criterion for the entering variable and outgoing variable?
14. How an unbounded solution is recognized when calculating the simplex tableaus.
15. How a multiple optimal solution is recognized when algorithm. using the simplex
16. How no feasible solution is recognized when using the simplex algorithm.

17. Write the standard form of the following LPP: Maximize (z) = x – y + 2z;

Subject to x – z ≥ 4, y + 2z ≤ 5, x – y + z = 3; x, y, z ≥ 0.

18. Write the canonical form : Max Z = 3x + 5y; subject to x – 3y = 4, – x + y ≥ 1;

x, y ≥ 0.

19. Write the following L.P.P. in its standard form Min Z = x1 – 3x2 + 2x3; Subject to
3x1 – x2 + 3x3 ≤ 7, – 2x1 + 4x2 ≤ 12, – 4x1 + 3x2 + 8x3 ≥ – 10; x1, x2 , x3 ≥ 0.

20. Define the dual of a linear programming problem.

21. Write the dual of the LP problem: Maximize Z = x1-x2+3x3 ;

subject to x1+x2+x3 ≤ 10, 2x1-x2-x3 ≤ 2, 2x1-2x2-3x3 ≤ 6; x1, x2, x3 ≥ 0.

22. Write the dual of the LP problem: Minimize Z = 8x1+3x2 ;

subject to x1-6x2 ≥ 2, 5x1+7x2 ≥ 4; x1, x2 ≥ 0.

23. Write the dual of the following linear programming problem:

Maximize Z = x1 + 2x2 – x3;

Subject to 2x1 – 3x2 + 4x3 ≤5, 2x1 – 2x2 ≤ 6, 3x1 – x3≥ 4; x1, x2, x3 ≥0.

24. Write the dual of the following primal LP problem:

Minimize Z= x1-3x2-2x3; subject to 3x1-x2+2x3 ≤7, 2x1-4x2≥ 12, -4x1+3x2+8x3=10;

x1, x2, x3 ≥ 0.

25. Give the names of methods of finding an IBFS of a transportation problem.

Which method gives better solution?

26. With reference to transportation problem define a) Feasible solution, b) Basic

feasible solution.

27. Define: Optimal solution of transportation problem.

28. Define Non-degenerate basic feasible solution transportation problem.

29. Use north-west corner method to find an IBFS to the following transportation
problem:
 D1 D2 D3 Supply

O2 5 3 12 70

O3 3 10 4 70

Demand 30 65 45

30. Explain degeneracy in the transportation problem. How can it be resolved?

31. What is the condition for non-degenerate basic feasible solution in
transportation problem?

32. Convert following Transportation problem into LPP.

Supply
D1 D2
35
O2 20 15
4 11 20
O3
15 40
Demand

33. If the following is an IBFS of the transportation problem, is it non-degenerate?

34. What is an Assignment Problem?

35. What is unbalanced assignment problem? Explain how to balanced it.
36. How do you convert the maximization assignment problem into minimization?
37. Solve the following assignment problem for minimization the total time for doing
all jobs

Machines
I II III
Jobs A 7 6 5
B 3 7 3
C 2 9 7
38. Solve the following assignment problem;

I II III
A 10 5 9
B 4 8 5
C 3 4 1

39. Convert following Assignment problem into LPP:

Machines
I II III
Jobs A 2 6 4
B 6 3 7
C 4 6 1

40. How many solutions are there for the following assignment problem?
I II III
A 2 6 4
B 6 2 6
C 4 6 2

41. What is Maximin principle?

42. What is Minmax principle?
43. Define mixed strategy.
44. Define Optimal Strategy.
45. Define ‘Fair game’.
46. What is stable game?

47. Determine the saddle point of the following game:

Player B
1 2 3 4
Player 1 8 6 2 8
A 2 8 9 4 5
3 7 5 3 5

48. Solve the game with the given pay-off matrix :

Player B
3 4 5
Player A �2 −2 −1�
0 7 2
 49. Find 𝜆𝜆 such that the following game has saddle point:

Player B
λ 6 2
Player A �−1 λ −7�
−2 4 λ
50. Find the saddle point of the following game.

B1 B2 B3
A1 6 8 6
A2 4 12 2

D) Long answer question:

1. A firm manufactures two products A and b on which the profits earned per
unit are Rs 3 and Rs 4 respectively. Each product is processed on two machines
M1 and M2. Product A requires one minute of processing time on M1 and two
minutes on M2 while B requires one minute on M1 and one minute on M2.
Machine M1 is available for not more than 7 hours, while machine M2 is
available for 10 hours during any working day. Formulate the number of units
of products A and B to be manufactured to get maximum profit.

2. Solve the following LP problem by graphically:

Maximize Z = 4x1+4x2;
Subject to
x1+2x2≤ 10, 6x1+6x2≤ 36, x1 ≤ 6
and x1, x2 ≥ 0.

3. Solve the following LP problem by graphically:

Minimize Z = x1-2x2;
Subject to
-2x1+x2 ≤ 8, -x1+2x2 ≤ − 24,
and x1, x2 ≥ 0.

4. Solve the following Linear programming problem by simplex method.

Maximize Z = x1 + 2x2
Subject to, –x1 + 3x2 ≤ 10, x1 + x2 ≤ 6, x1 – x2 ≤ 2,
and x1, x2 ≥ 0.

5. Solve the following Linear programming problem by simplex method.

Maximize Z = 2x1 + x2
Subject to, x1 - x2 ≤ 10, 2x1 - x2 ≤ 40,
and x1, x2 ≥ 0.

6. Solve the following Linear programming problem by Big-M method.

Minimize Z = 2x1 + x2
 Subject to, 3x1 + x2 = 3, 4x1 +3 x2 ≥ 6, x1 +2 x2 ≤ 4,
and x1, x2 ≥ 0.
7. Solve the following Linear programming problem by simplex method.
Maximize Z = 6x1 + 3x2
Subject to, 2x1 + x2 ≤ 8, 3x1 +3x2 ≤ 18, x2 ≤ 3,
and x1, x2 ≥ 0.

8. Solve the following Linear programming problem by simplex method.

Maximize Z = 3x1 + 6x2
Subject to, 3x1 + 4x2 ≥ 12, -2x1 + x2 ≤ 4,
and x1, x2 ≥ 0.

9. Solve the following Linear programming problem by simplex method.

Maximize Z = 2x1 + 3x2
Subject to, x1 - x2 ≥ 4, x1 + x2 ≤ 6, x1 ≤ 2,
and x1, x2 ≥ 0.

10. Solve the following Linear programming problem by simplex method.

Maximize Z = 2x1 + 4x2
Subject to, 2x1 + x2 ≤ 18, 3x1 + 2x2 ≥ 30, x1 + 2x2 = 26,
and x1, x2 ≥ 0.

11. Write the dual of the following LPP. Using simplex method solve this dual and
hence write the solution of the primal problem.
Maximize Z = 3x1 + 2x2
Subject to x1 + x2 ≤ 4, x1 – x2 ≤ 2,
and x1, x2 ≥ 0.

12. Find the IBFS by least cost method of following transportation problem:

D1 D2 D3 Supply

O1 5 1 7 10

O2 6 4 6 80

O3 3 2 5 15

Demand 75 20 50
13. Find an IBFS to the following transportation problem by Vogel’s approximation
method:

Destination

1 2 3 4 Availability

A 7 2 5 5 30
Origin
B 4 4 6 5 15

C 5 3 3 2 10

D 4 -1 4 2 20

Requirement 20 25 15 15

14. Find the initial basic feasible solution by North-West corner method. Obtain its
optimal solution by MODI method for the following transportation problem.
Destination D1 D2 D3 D4 Supply
→
___________
Origin ↓
10 2 20 11 15
O1
12 7 9 20 25
O2
4 14 16 18 10
O3
5 15 15 15
Demand

15. Use the North-west corner rule to find IBFS to the following transportation
problem:
D1 D2 D3 Supply
5 3 12 70
O1
3 10 4 70
O2
30 65 45
Demand
16. Find the IBFS of the following transportation problem by VAM method and
obtain the optimal solution by MODI method:
Destination D1 D2 D3 D4 Supply
→
___________
Origin ↓
9 5 8 5 225
O1
9 10 13 7 75
O2
14 5 3 7 100
O3
225 80 95 100
Demand

17. Show that the following solution of a transportation problem is an optimal

solution. Also find the alternative optimal solution:

18. Find IBFS of the following Transportation problem by least cost method and also
find optimal solution:

Destination D1 D2 D3 Supply
→
___________
Origin ↓
8 16 16 152
O1
32 48 32 164
O2
16 32 48 154
O3
144 204 82
Demand
19. Find the IBFS of the following transportation problem by NWC method and
obtain the optimal solution by MODI method:
D1 D2 D3 Supply
8 5 6 120
S1
15 10 12 80
S2
3 9 10 80
S3
150 80 50
Demand

20. A company has factories at four different places1, 2, 3, and 4 which supply
warehouses A, B, C, D, and E. shipment from 1 to B and 4 to D is not possible.
Following table gives unit shipping cost in rupees, monthly factory capacity
and monthly warehouse requirements. Determine the optimum distribution to
minimize shipping cost.
Warehouses→ A B C D E Capacities
___________
Factories ↓
13 _ 31 8 20 200
1
14 9 17 6 10 175
2
25 11 12 17 15 150
3
10 21 13 _ 17 325
4
110 90 120 230 160
Requirements

21. Find the optimal solution for maximize profit of following transportation
problem:
1 2 3 4 5 Supply
5 7 10 15 15 500
A
8 6 9 12 14 100
B
10 9 8 10 15 1250
C
300 300 100 500 400
Demand
22. Solve the following Assignment Problem

I II III IV 23.

5 3 4 7
A
2 3 7 6
B
4 1 5 2
C
6 8 1 2
D

23. Solve the following assignment problem

M1 M2 M3 M4
5 7 11 6
J1
8 5 9 6
J2
4 7 10 7
J3
10 4 8 3
J4

24. Solve the following assignment problem to maximize the profit

J1 J2 J3 J4
100 140 280 70
M1
130 160 200 60
M2
80 130 300 90
M3
150 110 250 50
M4

25. Solve following assignment problem

J1 J2 J3 J4
2 3 4 5
M1
4 5 6 7
M2
7 8 9 8
M3
3 5 8 4
M4
26. Solve following assignment problem
A B C D E
4 6 10 5 6
M1
7 4 __ 5 4
M2
__ 6 9 6 2
M3
9 3 7 2 3
M4

27. Solve the following assignment problem

Task
1 2 3 4 5
A 6 5 8 11 16
Persons B 1 13 16 1 10
C 16 11 8 8 8
D 9 14 12 10 16

28. Solve following game by using Saddle point method

Player B
I II III IV
1 20 15 12 35
Player 2 25 14 8 10
A 3 40 2 10 5
4 -5 4 11 0

29. Solve the following game by Algebraic method

Player B
B1 B2
Player A A1 1 3
A2 7 -5

30. Reduce the following game by dominance principle and solve it

Player B
B1 B2 B3 B4
A1 3 2 4 0
Player A2 3 4 2 4
A A3 4 2 4 0
A4 0 4 0 8
31. Solve the following game by graphical method
Player B
B1 B2 B3 B4
Player A A1 3 3 4 0
A2 5 4 3 7

32. Solve the following game by graphical method

Player B
B1 B2
A1 -2 5
Player A A2 -5 3
A3 0 -2
A4 -3 0
A5 1 -4

33. Solve following game by sub-game method

Player B
B1 B2 B3
Player A A1 1 3 11
A2 8 5 2

________________________________________________________________