İŞLETME KARAR MODELLERİ

Step 2. Take the probabilities of the two alternatives of the row player as p and (1-p), then expected pay- offs of column player for each strategy are expressed with equations.

Step 3. These equations are then plotted on the graph.

Step 4. Draw n straight lines for j=1, 2... n and determine the highest point of the lower envelope obtained. This will be the maximin point.

Step 5. The two or more lines passing through the maximin point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2. Take the probabilities of the two alternatives of the row player as p and (1-p), then expected pay- offs of column player for each strategy are expressed with equations.

Step 3. These equations are then plotted on the graph.

Step 4.Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 5. The two or more lines passing through the maximin point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2. Draw n straight lines for j=1, 2... n and determine the highest point of the lower envelope obtained. This will be the maximin point.

Step 3. These equations are then plotted on the graph.

Step 4.Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 5. The two or more lines passing through the maximin point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2. Draw n straight lines for j=1, 2... n and determine the highest point of the lower envelope obtained. This will be the maximin point.

Step 3. These equations are then plotted on the graph.

Step 4.Take the probabilities of the two alternatives of the row player as p and (1-p), then expected pay- offs of column player for each strategy are expressed with equations.

Step 5. The two or more lines passing through the maximin point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2. Draw n straight lines for j=1, 2... n and determine the highest point of the lower envelope obtained. This will be the maximin point.

Step 3.The two or more lines passing through the maximin point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 4.Take the probabilities of the two alternatives of the row player as p and (1-p), then expected pay- offs of column player for each strategy are expressed with equations.

Step 5. These equations are then plotted on the graph.

Step 2. Take the probabilities of the two alternatives of the column player as q and (1-q), then expected pay-offs of row player for each strategy are expressed with equations.

Step 3. These equations are then plotted on the graph.

Step 4. Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2. Take the probabilities of the two alternatives of the column player as q and (1-q), then expected pay-offs of row player for each strategy are expressed with equations.

Step 3. These equations are then plotted on the graph.

Step 4. Draw n straight lines for j=1, 2... n and determine the lowest point of the upper envelope obtained. This will be the minimax point.

Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2.Draw n straight lines for j=1, 2... n and determine the lowest point of the upper envelope obtained. This will be the minimax point.

Step 3. These equations are then plotted on the graph.

Step 4. Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2.Draw n straight lines for j=1, 2... n and determine the lowest point of the upper envelope obtained. This will be the minimax point.

Step 3. Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 4. These equations are then plotted on the graph.

Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 2.Draw n straight lines for j=1, 2... n and determine the lowest point of the upper envelope obtained. This will be the minimax point.

Step 3. Draw two vertical axes one unit apart. These two lines are 0 and 1.

Step 4. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

Step 5. These equations are then plotted on the graph.