Step 1 Convert the given general LPP into standard LPP.
i. Check whether the Objective Function of the LPP is Maximized or
Minimized.
ii. Check if all the Decision Variables are >=0
iii. All the values on the right-hand side must be positive
iv. Express the problem in standard form by introducing slack or
surplus variable to convert the inequality constraints into equation
Introduce slack /auxiliary variables.
if constraint type is ≤ introduce + S
if constraint type is ≥ introduce -S+a and
if constraint type is = introduce a
Step 2 Write the standard form LPP into matrix form.
AX=B
Step 3 Find out the values of initial basic feasible solution (IBFS).
Let decision variables X1=X2=0. Substitute these values in the
constraints, we get the Values of slack variables S1, S2, etc.
Step 4 Construct the initial simplex table.
Cj Min
Solution
Ratio=
CB B.V X1 X2 S1 S2 A1 (b)
b/KC
Zj
Cj-Zj
Here Cj = Coefficient of object variable/Objective function
CB = Coefficient of basic variable
BV = Basic variable
Step 5 Calculate the values of Zj = ∑ CBi * Xj
Step 6 Calculate the values of Cj -Zj and check the basic feasible solution
for Optimality
a. If all Cj -Zj ≤ 0 the optimum solution will be obtained
b. If Cj -Zj is +ve then indicate by arrow, and that column is called Key
column
c. If more than one Cj -Zj is +ve then choose the most +ve of them, and
that column is called Key column
CHECK SOLUTION FOR OPTIMALITY. IF OPTIMAL, STOP OTHERWISE
CONTINUE
Stpe 7 Take the most Positive coefficient in the Cj -Zj function to
identify the key column (the corresponding variable is the entering
variable of the next iteration table).
Step 8 Find the ratio between the solution value and the coefficient of the
key column. Enter the values in the minimum ratio column.
Step 9 Take the minimum positive value available in the minimum ratio
column to identify the key row. (The corresponding variable is the
leaving variable of the table).
Step 10 The intersection element of the key column and key row is the
pivotal element or Key Element
Step 11 Construct the next iteration table by eliminating the leaving
variable and introducing the entering variable.
Step 12 Convert the pivotal element as in the next iteration table and
compute the other elements in that row accordingly. This is the
pivotal equation row (not key row).
For New values for entering variable =Old value/Key element
MAKE KEY ELEMENT HAS UNITY
Step 13 Other elements in the key column must be made zero. For
simplicity, form the equations as follows
New value = Old value – (Corresponding key column value *
corresponding Key row value)/Ke
Step 14 Check the values of objective function. If there are Positive values,
the solution is not an optimal one; go to step 7. Else, if all the
values are Negative or Zero, optimality is reached. Non-negativity
for objective function value is considered. Write down the values of
x1, x2,........xi and calculate the objective function for maximization
or minimization.
Note:
(i) If there are no x1, x2 variables in the final iteration table, the values of xi
and x2 are zero.
(ii) Neglect the sign for objective function value in the final iteration table.
