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 …
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 …
Formulation of Linear Programming Problem In this article, we will discuss about how to formulate a linear programming problem. Problem formulation is the most important step in the operations research. In order to formulate the word problem as a linear programming problem follow the following steps: Step 1 Read and understand the word problem thoroughly. …
Linear Programming Problem (LPP) Optimization Problem Problems which seek to maximize or minimize a numerical function of a variables with the variables subject to certain constraints from a general class is called optimization problem. Programming Problem The term programming refers to the process of determining a particular program or plan of action. Programming problem deals …
Hungarian Algorithm to solve Assignment Problem The Hungarian algorithm of assignment is an efficient algorithm of finding an optimal solution to the assignment problem. Hungarian method is applicable to a Balanced Assignment problem, i.e., number of rows equals to the number of columns of an assignment problem. Step by Step procedure Hungarian algorithm of assignment …
Hungarian Method for Restriction on Assignment Problem Example In this article we will study the step by step procedure of Hungarian method to solve assignment problem with some kind of restriction. Assignment Problem with Restrictions Example Five employees are available to perform four jobs. The time it takes each person to perform each job is …
Travelling Salesman Problem Suppose a salesman wants to visit certain number of cities, say, $n$. Let $c_{ij}$ be the distance from city $i$ to city $j$. Then the problem of salesman is to select such a route that starts from his home city, passes through each city once and only once, and returns to his …
