Scribd
Upload
49 views4 pages

Major Core 12 - Optimization Techniques Ii No

This document discusses the graphical method for solving games using optimization techniques. It contains examples of using the graphical method to solve games with payoff matrices of various orders, including 2x2, 2xn, and mxn. The key aspects of the graphical method covered are determining the optimal strategies for the row and column players based on the highest or lowest points of the upper and lower envelopes, and the possibility of alternate optimal solutions when multiple lines pass through the determining point. Practice problems provided apply the graphical method to solve various game matrices.

Uploaded by

RobertBellarmine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views4 pages

Major Core 12 - Optimization Techniques Ii No

This document discusses the graphical method for solving games using optimization techniques. It contains examples of using the graphical method to solve games with payoff matrices of various orders, including 2x2, 2xn, and mxn. The key aspects of the graphical method covered are determining the optimal strategies for the row and column players based on the highest or lowest points of the upper and lower envelopes, and the possibility of alternate optimal solutions when multiple lines pass through the determining point. Practice problems provided apply the graphical method to solve various game matrices.

Uploaded by

RobertBellarmine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

MAJOR CORE 12

- OPTIMIZATION TECHNIQUES II

No. of Hours: 6

No. of Credits: 5

Code: U08MA6MCT15

1.3-graphical method
Code: U08MA6MCT15

Level: K

Unit :1.3

Type: MC

1.

Graphical method of solution in solving games when their payoff


matrix is of order
(a)

22

(b)

2n

(c)

mn

(d)

3n

m 2

2.

While solving a game whose payoff matrix is of order


,then the
optimal strategies for the column player are determined through
(a) the highest point of the upper envelope
(b)the lowest point of the upper envelope
(c) the highest point of the lower envelope
(d)the lowest point of the lower envelope

3.

While solving a game whose payoff matrix is of order


,then the
optimal strategies for the row player are determined through

2n

(a)the highest point of the upper envelope


(b)the lowest point of the upper envelope
( c)the highest point of the lower envelope
(d)the lowest point of the lower envelope
4.

When more than two lines pass through the point that decides optimum
strategies in graphical method, then the game
(a) has no optimal solution
(b)alternate optimal solutions
(c) method is not applicable
(d) restructure is required

Code: U08MA6MCT15

Level: K

Unit :1.3

Type: VSA

1.

When is graphical method preferred for solving a game?

2.

If the given payoff matrix having no saddle point is of order


how can the strategies for the row player be reduced?

3.

If the given payoff matrix having no saddle point is of order


how can the strategies for the column player be reduced?
When does a game have alternate optimum solutions in graphical
method?

4.

Code: U08MA6MCT15

Level: K

Unit :1.3

Type: PA

1.

m 2
2n

Solve the game with the following payoff matrix graphically.


Player B

Player A

2.

B1

B2

B3

B4

A1

-2

A2

Obtain the optimal strategies for both the players and the value of the
value of the game for two-person zero-sum game whose payoff matrix is
1

-3

-1

-5

3.

Use graphical method to solve the game:


Player A
Player B

4.

-2

Solve the game graphically:


Player B
Player A

5.

-3

-6

Obtain an optimal solution to the game with the payoff matrix


Player B

Player A

6.

-7

-4

-3

Solve the game with the payoff matrix


Player B

Player A

-4

-7

-2

-4

-5

-2

-1

-6

You might also like