Consider the following matrix representing a two-person zero-
sum game.
-1
4 3
2 -2 3
2
1
-1 2
4
2 0 3
A. Write the primal and dual linear programming problems
associated with this game.
B. Solve the game.
For the Cop & Robber problem with 4 east/west streets and 5 north/south avenues, let the
safehouses be located according to the following 0/1 matrix H:
A
=
000 0
00 0 1
0
0
0 0 1 0
1 0 0 1 1
find an optimal strategy for each player, and give the value of the game.
(a) Construct a 3 by 3 system that needs two row exchanges to reach a triangular form and a solution.(b) Construct a 3 by 3 system that needs a row exchange to keep going, but breaks down later.
Chapter 10 Solutions
Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences (13th Edition)
Fundamentals of Differential Equations and Boundary Value Problems
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY