9.4 Linear programming and m x n Games: Simplex Method and the Dual Problem In this section, the process of solving 2 x 2 matrix games will be generalized.

Slides:



Advertisements
Similar presentations
The Assignment Problem
Advertisements

Standard Minimization Problems with the Dual
Nonstandard Problmes Produced by E. Gretchen Gascon.
Chapter 6 Linear Programming: The Simplex Method
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Sections 4.1 and 4.2 The Simplex Method: Solving Maximization and Minimization Problems.
4.1 Slack Variables and the Simplex Method Maximizing Objective Functions Maximize the objective function subject to: What would this look like?
1. The Simplex Method for Problems in Standard Form 1.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
Linear Inequalities and Linear Programming Chapter 5
The Simplex Method: Standard Maximization Problems
5.4 Simplex method: maximization with problem constraints of the form
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
5.6 Maximization and Minimization with Mixed Problem Constraints
Game Theory.
Chapter 4 The Simplex Method
6  Graphing Systems of Linear Inequalities in Two Variables  Linear Programming Problems  Graphical Solutions of Linear Programming Problems  The Simplex.
Linear Programming - Standard Form
Learning Objectives for Section 6.2
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
Chapter 3 Linear Programming Methods 高等作業研究 高等作業研究 ( 一 ) Chapter 3 Linear Programming Methods (II)
The Dual Problem: Minimization with problem constraints of the form ≥
Chapter 6 Linear Programming: The Simplex Method
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
We will use Gauss-Jordan elimination to determine the solution set of this linear system.
Simplex Algorithm.Big M Method
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
ECE 556 Linear Programming Ting-Yuan Wang Electrical and Computer Engineering University of Wisconsin-Madison March
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
The Simplex Method. Standard Linear Programming Problem Standard Maximization Problem 1. All variables are nonnegative. 2. All the constraints (the conditions)
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
4  The Simplex Method: Standard Maximization Problems  The Simplex Method: Standard Minimization Problems  The Simplex Method: Nonstandard Problems.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to three  constraints.
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
THE SIMPLEX ALGORITHM Step 1 The objective row is scanned and the column containing the most negative term is selected (pivotal column) - indicate with.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
How To Find The Reduced Row Echelon Form. Reduced Row Echelon Form A matrix is said to be in reduced row echelon form provided it satisfies the following.
1 THE REVISED SIMPLEX METHOD CONTENTS Linear Program in the Matrix Notation Basic Feasible Solution in Matrix Notation Revised Simplex Method in Matrix.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.
Chapter 5: Matrices and Determinants Section 5.5: Augmented Matrix Solutions.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
5.5 Dual problem: minimization with problem constraints of the form Associated with each minimization problem with constraints is a maximization problem.
Solving Systems of Equations Using Matrices
Solving Linear Program by Simplex Method The Concept
Simplex Algorithm.Big M Method
LINEAR PROGRAMMING.
Tools for Decision Analysis: Analysis of Risky Decisions
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 4 Linear Programming: The Simplex Method
The Simplex Method: Standard Minimization Problems
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
The Simplex Method: Nonstandard Problems
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Copyright © 2019 Pearson Education, Inc.
9.3 Linear programming and 2 x 2 games : A geometric approach
LINEAR PROGRAMMING Example 1 Maximise I = x + 0.8y
THE SIMPLEX ALGORITHM Step 1
Presentation transcript:

9.4 Linear programming and m x n Games: Simplex Method and the Dual Problem In this section, the process of solving 2 x 2 matrix games will be generalized to solving m x n matrix games. The procedure will be essentially the same as the process for the 2 x 2 case, but the solution of the linear programming problem will incorporate the simplex method and the dual.

Procedure: Given the non-strictly determined matrix game M, free of recessive rows and columns, to find and v proceed as follows: 1. If M is not a positive matrix, add a suitable positive constant k to each element of M to get a new matrix M1 If v1 is the value of game M1 , then the value of the original game M is given by v = v1 – k

Procedure continued: 2. Set up the two linear programming problems ( maximization problem is always the dual of the minimization problem) : A) Minimize subject to : B) Maximize: subject to:

V for the original game, M. Procedure continued: Step 3. Solve the maximization problem, part (B) , the dual of part (A), using the simplex method as modified in section 5.5. [You will automatically obtain the solution of the minimization problem, Part A, as well, by following this process. ] Step 4. Use the solutions from the third step to find the value of the game , v1 for game M1 and the optimal strategies and value V for the original game, M.

An example Suppose that an investor wishes to invest $10,000 in long and short term bonds, as well as in gold, and he is concerned about inflation. After some analysis he estimates that the return (in thousands of dollars) at the end of a year will be indicated in the following payoff matrix: Inflation rate up 3% down 3% gold long term bonds short-term bonds

Example continued Assume that fate is a very good player that will attempt to reduce the investor’s return as much as possible. Find the optimal strategies for both the investor and fate. What is the value of the game? 1. We start with the payoff matrix and need to make all entries positive so we choose to add a constant k = 4 to each entry:

Example continued 2. Write the corresponding linear programming problems: subject to: Maximize:

Example continued: 3. Introduce slack variables and form the simplex tableau and solve the second linear programming problem:

Solution: After performing the steps, the final solution is displayed below: The value of the game is zero, which means it is a fair game.