Shown below is the solution to the linear program for finding Player A's optimal mixed strategy in a two-person, zero-sum game. OBJECTIVE FUNCTION VALUE = 3.500 VARIABLE VALUE REDUCED COSTS PA1 0.050 0.000 PA2 0.600 0.000 PA3 0.350 0.000 GAINA 3.500 0.000 CONSTRAINT SLACK/SURPLUS DUAL PRICES 1 0.000 −0.500 2 0.000 −0.500 3 0.000 0.000 4 0.000 3.500 a. What is Player A's optimal mixed strategy? b. What is Player B's optimal mixed strategy? c. What is Player A's expected gain? d. What is Player B's expected loss?

Following are the answer to this question:

Step-by-step explanation:

For Option a:

Its optimal mixed approach for Player A's to Player A  

A1 with a chance of .05 utilizing technique  

Using the .60 chance strategy for A2  

Use the .35 possibility strategy for A3  

For Option b:

Optimal level mixed approach for team B:  

Use the strategy for B1 with a probability of 50  

Using the chance strategy for B2 at .50  

no  use strategy for B3  

For Option c:

The estimated gain of Player A will be= 3.500

For Option d:

The estimated loss of Player B will be 3.500

the 1st digit is in the 100s n its 1

step-by-step explanation:

3,589÷18 = 199.389

so the first digit of the quotient is in the 100s n its 1