Provide an appropriate response.The optimal strategy for a 2 × 5 matrix game can be found as follows: obtain 5 linear functions by finding the inner product of x(t) = with each of the columns of the payoff matrix A. Graph the 5 linear functions on a t-z coordinate system. Then ?(x(t)) is the minimum value of the 5 linear functions which will be seen on the graph as a polygonal path. The z-coordinate of any point on this path is the minimum of the corresponding z coordinates of points on the 5 lines. The highest point on the path ?(x(t)) is M. Suppose that only the lines corresponding to columns 1 and 4 of matrix A pass through the point M. What can be said about the optimal

Question

column strategy  ?



A.  =  
B.  =  where c₂ + c₃ + c₅ = 1
C.  =  
D.  =  where c₁ + c₄ = 1

Answer 1

Answer: D