Question

For the following matrix game, write down the equivalent LPPs for solving the game.

           B

A = \begin{bmatrix} -1 &2 \\ 1& 0 \end{bmatrix}

14 Feb 2018
Answer :
Word Count : 427
The matrix game presented is represented by the matrix \( A = \begin{bmatrix} -1 & 2 \\ 1 & 0 \end{bmatrix} \). This matrix represents a two-player zero-sum game, where Player A chooses rows and Player B chooses columns. We want to formulate the equivalent Linear Programming Problems (LPPs) for solving the game. ### Step 1: Define the Strategy Variables Let: - \( x_1 \) and \( x_2 \) be the probabilities that Player A chooses the first and second rows, respectively. - \( y_1 \) and \( y_2 \) be the probabilities that Player B chooses the first and second columns, respectively. We assume the players will randomize their strategies to maximize their expected payoffs. ### Step 2: Set up the LPP for Player A (Maximization Problem) For Player A, the objective is to maximize their expected payoff, which can be written as: \[ V = -1x_1 + 2x_2 \] where \( V \) is the expected
______ ___ _____ ___ _____.
_______ ____ ______ ____ ______ ________ ____.
_________ _____ ______ _____ ___ ___ _____ _____.
_____ __________ ______ ___ ________ _______ _____ _______ _______ _______ ____.
______ ___ ________ ___ _________ _________ __________ ______ ______ ____ ____.
_____ _____ _______ ____ ____ ________ _________ _________ ________ _______ ________ ________.
_________ ______ _____ _________ ________ ______ ____ ___ ________ _______ ___.
_______ ________ ___ _________ ________ _______ ________ ________ ______ _____ __________.
______ ______ _____ _________ ______ ___ _______ _______ ___ ___.
______ ____ __________ _______ _______ ____ ________.
______ _____ _____ ______ _______ ______ ________ ______ _________ __________ ___ __________.
______ ________ _____ _______ ___ ___ ___.
_______ _____ ____ ______ ______ _____ __________.
________ ___ _______ ___ _________ ___ ________ _________ __________ ____.
______ ___ _____ _________ __________ _______ _________ __________ ______ ________ ____.
________ ______ _____ ___ ____ ___ _____ ______ ________ ____ __________.
_________ ______ _____ _____ ___ _______ __________ ___ ___ _______ _____ _______.
_________ ______ _______ _________ ______ _____ _____ ___.
_____ _________ _________ ________ ___ ____.
__________ ______ _____ ___ ________ _____ ____ ________ ____ ________.
_________ _____ ________ _______ _______ ______ ___ __________.
____ ______ __________ ________ _________ ___.
______ ________ ____ ____ _______ ________ ___ _______ _________ ______.
__________ _________ _______ ___ _____ ____ __________ _______ _____ _________.
__________ _______ ________ ______ _______ ___ ____ _____.
____ _______ ________ _______ ________ ____ _____ ______ _____ ___.
__________ ____ _________ ____ _______ _____ _____ _____ ___ ___.
______ _________ ___ ______ __________ _______.
_____ __________ ________ _____ _________.
_________ __________ __________ _______ _________ ______ ___.
__________ ______.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Call Us WhatsApp
STUDY • PREPARE • SUCCEED
Skip in 10
Related Questions

If A =\begin{bmatrix} 1 &5 &3 \\ 2 &5 &7 \end{bmatrix},B = \begin{bmatrix} 1\\3 \end{bmatrix} and C = [1,2] compute A'B, AC, B'A + CB, whenever defined. If you think any of these is not defined, give reason for saying so.

Find an initial basic feasible solution to the following transportation problem by the North-West corner method. Check whether your solution is optimal.

6 4 1 5 14
8 9 2 7 16
4 3 6 2 5
6 10 15 4  

 

Which of the following statements are true or false? Give reasons for your answer.
i) The number of basic variables in a feasible solution of a transportation problem with m sources and n destinations is mn.
ii) An optimal assignment of the assignment problem with cost matrix C is also an optimal assignment of the assignment problem with cost matrix Ct .
iii) (1, 2) is an optimal solution to the following LPP:
Max Z = 2x + 4x
subject to x1 + 2x2 < 5
x1 + x2 < 4
x1 ,x2 > 0

iv) The intersection of a finite number of convex sets is not a convex set.
v) If value of the 2X2 matrix game \begin{bmatrix} 1 &2 \\ P &4 \end{bmatrix} is 4, then p > 4.

Write the dual of the following LPP:
Maximize z = 2x1 + x2
Subject to x1 + 5x2 < 10
                x1 + 3x2 > 6
                2x1 + 2x2 < 8
                 x2 > 0, x1 is unrestricted in sign.

Prove that the dual of dual of a LPP is primal LPP.

A departmental head has four subordinates, and four tasks to be performed. The subordinates differ in efficiency, and the tasks differ in their intrinsic difficulty. His estimate, of the time each subordinate would take to perform each task is given in the matrix below:

Tasks    Subordinnate
E F G H
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10

How should the task be allocated, one to a subordinate, so as to minimize the total time?

Solve the following game by graphical method.

\begin{bmatrix} -2&0 \\ 3&-1 \\ -3&2 \\ 5&-4 \end{bmatrix}

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers
Login
Top
📞
Call Support Instant phone assistance IGNOU MTE 12 2018 - For the following matrix game, write down the equivalent LPPs for solv | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→