The document describes the steps of the simplex method algorithm for solving linear programming problems. It begins by converting the linear programming model into standard form by adding slack, surplus, and/or artificial variables. It then sets up an initial simplex table to obtain the initial solution and computes various values. Based on whether the problem is a minimization or maximization type, it selects the key column with the most negative or positive value. The key row is then selected and the simplex table is updated through elementary row operations. The process is repeated until an optimal solution is found.

1. Subject: Operations Research
Topic: Simplex Method Algorithm/Flowchart
By
A. Raja

2. Simplex Method Flowchart
START
•Convert LP model into standard form by adding either
slack variables, surplus variables and/or artificial
variables.
•Decide coefficient of these variables in the objective
function.

3. MINIMIZATION MAXIMIZATION
Set up initial simplex table to obtain initial solution
Compute Zj and Cj-Zj values
Is LP
PROBLEM
OF
MAX/MIN
TYPE?

4. NO NO
YES YES
This solution is
optimal
Do Cj-
Zj
negativ
e values
exist?
Do Cj-
Zj
positive
values
exist?
Select key column
with large negative
Cj-Zj values
Select key column
with large positive
Cj-Zj values

5. •Select key row with min XB/Xk >=0
•If all zero, then current (where
xk>=0)
Solution is unbounded &stop the
procedure
Identify key element at the intersection of
key row and key column
Update the entries in the simplex table by
•First obtaining key row values and
•Apply elementary row operations

6. THANK YOU
Note: Because of space restriction, I unable to draw the flowchart in a single page.
First you draw the complete flowchart in a single page, then you will get clear picture.