OPERATIONS RESEARCH-

Notes on Simplex Method

Prof. Soumyajyoti Datta

1
Standard form
Appropriate sign of inequalities

Non-negative RHS of constraints

Each decision variable should be non-negative

Unrestricted variables should be transformed

2
 Few Terminologies
▪Basic variables-basic solution – variables which are sitting in the basis region of the simplex tableau in a given iteration

▪Non basic variables-non-basic solution- variables which are not a part of the basis in the simplex tableau in a given iteration

▪Basic feasible solution-– every basic feasible solution is a corner point in the graphical method

▪Identity matrix

▪Key column, key row and key element

▪Entering variable and leaving variable (basis)- In every iteration the basis gets updated with the new entering variable and removing the old leaving
variable.

▪Test for optimality- decides at which iteration do we stop the simplex method

3
 Simplex-Unplugged
Step1 -Form standard form of the LP
Step 2- Form the simplex tableau
Step 3- Test for optimality
if test fails
Update the basis
select entering variable
select the leaving variable
Update the rows by row operations
GOTO step3
Step 4- Declare optimal objective and solution

4
Thank you !