Graphical Method for Linear Programming Problem Graphical method to solve a linear programming problem (LPP) is used to solve a linear programming problem with two variables only. It help us to visualize the the procedure of finding the optimal solution to a linear programming problem. Step 1 Given a LPP, consider each inequality (say, $ax+by …
Graphical method to solve $2\times n$ game A game where one player has only two course of action and the other player has more than two (say $n$) course of action is called $2\times n$ game. Graphical method can be used to solve a $2\times n$ or $m\times 2$ game or a game reducible to …
Graphical method to solve $m\times 2$ game A game where one player has more than $m$ course of action and the other player has only two course of action is called $m\times 2$ game. Graphical method can be used to solve a $2\times n$ or $m\times 2$ game or a game reducible to either $2\times …
In this tutorial we will discuss the dominance property and some examples based on the use of dominance property to solve the game. Dominance Property In some of the games, one pure strategy of a player is better or superior than another strategy (irrespective of the strategy used by the opponent player). In such a …
Algebraic Method to solve a game Algebraic method is used to solve the game under following situations: if the game is $2\times 2$ game and the game has no saddle point, or if the game is $m\times n$ game and the game has no saddle point and it can be reduced to $2\times 2$ game …
In this article we will discuss about an algebraic method to solve by 2 or m by n game. Algebraic method for 2 by 2 or m by n game When pure strategies does not exists for a $2\times 2$ game or $m\times n$ game reducible to $2\times 2$, then algebraic method is used. Thus …
Maximin-Minimax Principle Consider a game with two players $A$ and $B$ in which player $A$ has $m$ strategies (moves) and player $B$ has $n$ strategies (moves). The game can be described in the form of a payoff matrix such that the cell entry $a_{ij}$ is the payment to $A$ in $A$’s payoff matrix when $A$ …
In this tutorial we will discuss about the game theory, various types of game and various terms related to game theory. Game Theory Usually when we heard about the game, the first thought came to our mind is about the game from sports (like cricket, hockey, football, etc.) or a computer game. But the game …
What is the Simplex Method? The simplex algorithm is the most extended procedure to solve the linear programming problem (LPP) developed by George Bernard Dantzig in 1947. Most of the real world linear programming problems have more than two variables. Such problems with more than two variables cannot be solved graphically. The simplex method is …
Standard form of LPP In this tutorial, we will discuss about what is the standard form of linear programming problem?, what are the characteristics of standard form of linear programming problem?, how to convert LPP to its standard form?. Important Definitions Unrestricted Variables Many times one encounter problems of the LPP in which some or …
