Scribd
Upload
14 views1 page

Two Phase Simplex Algorithm

The two phase simplex method algorithm involves adding slack and surplus variables to inequality constraints, changing the objective function to minimize artificial variables, and running the simplex method in two phases. In the first phase the algorithm seeks a basic feasible solution and removes artificial variables. In the second phase it optimizes the original objective function to find an optimal solution.

Uploaded by

yashvant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views1 page

Two Phase Simplex Algorithm

The two phase simplex method algorithm involves adding slack and surplus variables to inequality constraints, changing the objective function to minimize artificial variables, and running the simplex method in two phases. In the first phase the algorithm seeks a basic feasible solution and removes artificial variables. In the second phase it optimizes the original objective function to find an optimal solution.

Uploaded by

yashvant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TWO PHASE SIMPLEX METHOD ALGORITHM

1. Add one slack variable for each constraint. The co-efficient of slack variable in the
constraint is +1 and in the objective function is 0.
2. Add one surplus and one artificial variable for each constraint. Co-efficient of
surplus variable in the constraint is -1 and in the objective function is 0. Co-efficient
of artificial variable in the constraint is +1 and in the objective function is -1.
3. Change the objective function by assuming 0(zero) co-efficient to all the variables
and retaining the -1 co-efficient for all artificial co-efficient alone. Rewrite the
constraints.
4. Write the IBFS.
5. Draw the starting table and check for optimality. If it is not optimal proceed until you
get an optimal table.
6. Check for the following conditions.
(i)

Optimal table

(ii)

Z=0

(iii)

At least one artificial variable should have been disappeared from the
basis.

7. If the above conditions are satisfied, proceed to the next step.


8. Convert the objective function by giving original co-efficient to all the variables and
deleting the artificial variable.
9. Draw the starting table by deleting the artificial variable. Fill up the values from the
previous table.
10. Use the simplex algorithm and proceed until you get an optimal table. Finally write
down the optimal solution.

You might also like