For problems ag build a linear programming model for each player's decisions and solve it both geometrically and algebraically. Assume the row player is maximizing his payoffs which are shown in the matrices below.

a.

b.

c.

d.

e. A predator has two strategies for catching a prey (ambush or pursuit). The prey has two strategies for escaping (hide or run).

f.

g.

Transcribed Image Text:

Rose R1 R2 Colin C1 10 5 C2 10 0