For problems ag build a linear programming model for each player's decisions and solve it both geometrically

Question:

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. Rose R1 R2 Colin C1 10 5 C2 10 0


b. Rose R1 R2 C1 Colin 201 C2 -I2O 0


c. Batter Guesses fastball Guesses knuckleball Fastball .400 .300 Pitcher Knuckleball .100 250


d. Rose R1 R2 C1 23 Colin C2 1 4

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

Prey Run Hide Predator Ambush 0.20 0.80 Pursue 0.40 0.60

f. Rose R1 R2 C1   5 3 Colin C2 1 0


g. Rose RI R2 C1 1 5 Colin C2 3 2

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

A First Course In Mathematical Modeling

ISBN: 9781285050904

5th Edition

Authors: Frank R. Giordano, William P. Fox, Steven B. Horton

Question Posted: