Solve Linear Programs by Graphical Method

Linear Programs Problems solve by Two methods

1.Graphical Method: Graphical Method for Maxizaton and minimization of objective
function and two decision variables
2.Simplex method: two decision variables and more the two variable

Graphical method of linear programming is used to solve problems by finding the

highest or lowest point of intersection between the objective function line and the feasible
region on a graph.

The graphical method is applicable to solve the LPP involving two decision variables x 1,
and x2, we usually take these decision variables as x, y instead of x1, x2. To solve an LP, the
graphical method includes two major steps.
Working rules for Graphical Method:
 Simplex Method

Definition: The Simplex Method or Simplex Algorithm is used for calculating the optimal
solution to the linear programming problem. In other words, the simplex algorithm is an iterative
procedure carried systematically to determine the optimal solution from the set of feasible
solutions.
George Dantzig developed the simplex method in 1946 .The method is also known as the simplex
algorithm.
▪Firstly, to apply the simplex method, appropriate variables are introduced in the linear
programming problem, and the primary or the decision variables are equated to zero.
▪. The iterative process begins by assigning values to these defined variables.
▪ The value of decision variables is taken as zero since the evaluation in terms of the graphical
approach begins with the origin. Therefore, x1 and x2 is equal to zero.
The decision maker will enter appropriate values of the variables in the problem and find out
the variable value that contributes maximum to the objective function and removes those
values which give undesirable results.
Thus, the value of the objective function gets improved through this method. This procedure of
substitution of variable value continues until any further improvement in the value of the
objective function is possible.
 Following two conditions need to be met before applying the simplex method:
▪The right-hand side of each constraint inequality should be non-negative. In case, any linear
programming problem has a negative resource value, then it should be converted into positive
value by multiplying both the sides of constraint inequality by “-1”.
▪The decision variables in the linear programming problem should be non-negative.
▪Thus, the simplex algorithm is efficient since it considers few feasible solutions, provided by the
corner points, to determine the optimal solution to the linear programming problem.

A
 Terminology of LPP (Simplex
Method)
1. Standard Form: A LPP in which all constraints are written in equalities.
2. Slack Variable: A variable added to the LHS of “less than or equal to” constraint to
convert the convert the constraint into an equality. Value of slack variable indicates unused
resources.
3. Surplus Variable: A variable subtracted from the LHS of “more than or equal to” constraint
to convert the convert the constraint into an equality. Value of surplus variable indicates
consumption over & above minimum requirements.
4.Simplex Tableau: A table used to keep record of the calculation made at each iteration.

Type of inequality Type of variable

≥ - surplus + artificial
= + artificial
≤ + slack
 Type of inequality Type of variable

- surplus, + artificial 2x1+3x2 ≥60

≥ ( two sign) and mini 2x1+3x2 –S+A=60

+ artificial 2x1+3x2 =60

=
2x1+3x2 +A = 60

+ slack ,
2x1+3x2 ≤ 60
≤ ( maxi)
2x1+3x2 +s=60
 Terminology of LPP (Simplex
Method)
5. Basis: The set of variables which are not restricted to equal zero in the
current basic solution. The variables which make up the basis are called Basic
variables. The remaining are called non-basic variables.
6. Iteration: The steps performed in simplex method to progress form one feasible
solution to another.
7. Cj Row: A row in the simplex table which contains the coefficients (unit
profit) of the variables in the Objective function.
8. Zj Row: A row in the simplex tables whose elements represent the increase /
decrease in the value of objective function; if one unit of that variable is brought into
the solution.
 Terminology of LPP (Simplex
Method)
9.Zj – Cj Row (Index Row): A row in the simplex table whose elements
represent net contribution / loss per unit if one unit of that variable is
brought into the solution.
10. Key column: The column with the largest positive / negative
index number. It indicates the Entering variable in the Basis.
11. Key row: The row with the smallest positive ratio found by
dividing Quantity column values by Key column values for each row. It
indicates the Exiting variablefrom the Basis.
12. Key element: The element at the intersection of Key row & Key
column.
 LIMITATIONS OF LPP SIMPLEX METHOD

1. Simplex method Involves understanding of many conceptual technical aspects.

These cannot be understood by any manager not conversant with the subject.
2. Linear programming problems need lot of expertise, time and are cumbersome.
A number of steps have to be adopted to proceed in a systematic manner before one
can arrive at the solution.
3. Graphic solution method has lot of applications and is relatively short and
simple. However, it has limitations and cannot be applied to problems with more
than two variables in the objective function.
4. Simplex method of LPP can be applied to problems with more than two
variables in the objective function, the procedure adopted is complicated and long.
It may need computation of 4 to 5 simplex tables and can test the patience of the
problem solver. Computers are of course helpful in such cases.
 LIMITATIONS OF LPP SIMPLEX METHOD

5. LPP does not lead to ‘a unique’ optimal solution. It can provide different types of
solutions like feasible solution, infeasible solution, unbounded solution, degenerate solution
etc.
6. It gives absurd or impractical results in many solutions. The solution may ask for
providing men or 3· 89 machines which is not possible.
7. LPP model makes many assumptions in the values of objective function and constraint
variables, like the rate of profit. In fact, such assumptions may not be right.
8. The whole approach to the solution is based on the linearity of the functions i.e., all the
variables involved in the problem increase or decrease in a linear manner. This assumption
does not hold good in all cases. In many cases, the objective function may assume the form of
a quadratic equation.
LPP method cannot be used where a number of objectives are required to be fulfilled. It deals
with other maximising of profits, minimisation of costs etc.
 The Simplex Method (2)

❖ Steps involved:
1. Locate an extreme point of the feasible region.
2. Examine each boundary edge intersecting at this point to see
whether movement along any edge increases the value of the
objective function.
3. If the value of the objective function increases along any edge,
move along this edge to the adjacent extreme point. If several
edges indicate improvement, the edge providing the greatest rate
of increase is selected.
4. Repeat steps 2 and 3 until movement along any edge no longer
increases the value of the objective function.