Solve the following game graphically:
To solve the given game numerically using graphical methods, we'll interpret the matrix as a payoff matrix for a two-player game. The values in the matrix represent the payoffs for Player A, and the rows and columns correspond to the strategies chosen by Player A and Player B, respectively. The matrix is: | | Player B chooses 1 | Player B chooses 2 | |-------------|-----------------------|-----------------------| | Player A chooses 1 | ______ ____ ______ ___ __________ _______ ______ ______.
_____ ______ __________ ________ ______ ________ ___ ______ __________ ________.
___ ______ ________ _________ ____ _____ ____ _______ ___ _________ ________ __________.
___ _______ _____ _____ ________ ____ ________.
________ ______ ________ _____ _______ ______ ______ ________ ______ _________.
__________ ___ _______ ______ __________.
_____ ____ _____ ____ __________ _____.
__________ _______ ___ ________ ______.
________ _____ _________ ________ ____ ___ _______ ____ ____ _________ __________.
_____ ____ _________ ______ ____ _______ ____ __________.
_____ __________ _________ ____ _______ _____ ____ ______ ____ __________ ____.
________ __________ _________ ________ ___ __________ __________ _______ _________ _________ _____ ________.
___ ____ _________ __________ _____ _______ _______ ______ _________.
_________ _____ _________ ___ ________ ______ ____ _____ _____ _________.
_______ ________ ______ _____ __________ ____.
_______ _________ ______ ________ ________ ___ __________ ________ _______.
___ ____ ___ _______ _____ ____.
____ ______ ___ ___ _________.
________ _____ _________ ___ ___ ____ _____ ___ _______.
_________ ____ _______ ___ _______ _________ ________ __________ _____ __________ _____.
__________ _________ __________ ______ ________ _____ ____ __________ ________.
___ ______ ___ ________ _____ ______ __________ _________.
__________ ___ ___ _____ ______.
__________ ___ ______ __________ ___ ___ _________.
_________ __________ _______ ________ _____.
_____ _________ ______ ____ ____ _________ _________ __________ _____ ______.
Get Full Answer on WhatsApp
Obtain the dual of the following primal LP problem:
Maximize z = x1 - 2x2 + 3x3
Subject to -2x1 + x2 + 3x3 = 2
2x + 3x2 + 4x3 =1
X1,X2X2 ≥ 0
Find all values of k for which the vectors:
are linearly independent.
A department has five employees with five jobs to be performed. The time (in hours) each employee will take to perform each job is given in the following matrix. How should the jobs be allocated, one per employee, so as to minimize the total man hours?
For the following pay-off matrix, transform the zero-sum game into an equivalent linear programming problem:
State which of the following statements are true and which are false. Give reasons for your answer with a short proof or a counter example.
a) The intersection of finite number of convex sets is not convex.
b) If value of the 2× 2 matrix game is 4, then p ≥ 4 .
c) If 10 is added to each of the entries of the cost matrix of a 3× 3 assignment problem, then the total cost of an optimal assignment for the changed cost matrix will increase by 10.
d) For maximization LP model, the simplex method is terminated when all values cj − zj ≥ .0
e) The dummy source or destination in a transportation problem is added to prevent solution from becoming degenerate.
Find the initial basic feasible solution of the following transportation problem using North-West Corner method.
| 90 | 90 | 100 | 110 | 200 |
| 50 | 70 | 130 | 85 | 50 |
| 75 | 100 | 100 | 30 |
न्यूनतम आव्यूह विधि का प्रयोग करके निम्नलिखित परिवहन समस्या का प्रारम्भिक आधारी सुसंगत हल ज्ञात कीजिए :
| 4 | 6 | 8 | 8 | 40 |
| 6 | 8 | 6 | 7 | 60 |
| 5 | 7 | 6 | 8 | 50 |
| 20 | 30 | 50 | 50 |