Provide an appropriate response.You have decided to solve a matrix game by using linear programming. You add 3 to each entry of the payoff matrix A to obtain a matrix B =
with only positive entries. You find the optimal strategy for column player C by solving the linear programming problem:Maximize y1 + y2 + y3 subject to ay1 + by2 + cy3 ? 1 dy1 + ey2 + fy3 ? 1and y1 ? 0, y2 ? 0, y3 ? 0The initial simplex tableau is y1 y2 y3 y4 y5 M
and suppose that the final tableau is y1 y2 y3 y4 y5 M
src="https://sciemce.com/media/4/ppg__aa0521192110__f1q39g3.jpg" style="vertical-align: -23.0px;" /> where g, h, i, j, k, and l are nonzero numbers and m, n, p, q, r, and v are positive numbers.What is the value of the original game with payoff matrix A?
A. v
B. v - 3
C. - 3
D.
Answer: C
You might also like to view...
Find the average value of the function f over the given region.f(x, y) = ex2 over the region bounded by ,
,
, and
.
A. 2e - 1
B. e - 1
C.
D.
Solve the compound inequality. Graph the solution set and write the solution in interval notation.x ? 5 or x ? -4
A. [-4, 5]
B.
(-?, -4] ? [5, ?)
C. ?
D. (-?, ?)
Compute the product or state that it is undefined.[-7 2 7]
A.
[-42]
B.
[-21 0 -21]
C.
D.
[141]
How long can a person rent the truck described in the ad if the cost is to be less than $120? Round your answer to the nearest hour.
A. Approximately 10 hr B. Approximately 8 hr C. Approximately 12 hr D. Approximately 15 hr E. Approximately 7 hr