Write the equation and slope intercept form y=mx+b

Shown below is the solution to the linear program for finding Player A's optimal mixed strategy in a two-person, zero-sum game.

Luba_88 [7]

Answer:

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

8 0

3 years ago

Alex is a writer who writes poems and short stories. For an upcoming writer's workshop Alex wants to write some new works. He ne

pashok25 [27]

Answer:

The maximum number of works that he can write while staying in his time budget is 24.

21 poems and 3 short stories

Step-by-step explanation:

In order to solve this problem we must first determine what our variables are. In this case it's the number of poems and short stories he can write.

p = # of poems

s = # of short stories

Next, we must build our objective function which will represent the total number of works he can write.

N=p+s

where N is the number of works.

Next, we must write the constrains based on the information provided by the problem.

The problem tells us that it takes him 30 hours to write a poem and 70 hours to write a short story and that he has 840 hours available to write them, so that constrain will be the following:

$30p+70s \leq 840$

it also tells us that he wants to write at least 4 poems and 3 short stories so there we have our other two constrains.

$p \geq 4$

$s \geq 3$

once we got our constrains we can go ahead and graph them to see how they will behave. (See attached picture)

In the graph p is the horizontal axis and s is the vertical axis.

On the graph we can see a polygon that is formed by the restriction. The vertices of the polygon will represent the optimal conditions for this linear programming problem. There are three optimal solutions there, so we need to test them to see which will return the greatest number of works he can write while keeping the given conditions.

Option 1:

4 poems and 3 short stories

N=4+3

N= 7 works

Option 2:

4 poems and 10 short stories

N=4+10

N=14 works

Option 3:

21 poems and 3 short stories

N=21+3

N=24 works