Scribd
Upload
699 views14 pages

Two-Phase Method in Optimization Techniques

The document discusses the two-phase method for solving linear programming problems (LPP). Phase I introduces artificial variables to form an auxiliary LPP that is solved to determine feasibility. Phase II uses the results of Phase I to find the optimal solution to the original LPP using the simplex method. The two-phase method handles cases where the original LPP is infeasible, feasible with an objective of 0, or feasible with artificial variables at 0 leading to the optimal feasible solution.

Uploaded by

Archit Madaan
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
699 views14 pages

Two-Phase Method in Optimization Techniques

The document discusses the two-phase method for solving linear programming problems (LPP). Phase I introduces artificial variables to form an auxiliary LPP that is solved to determine feasibility. Phase II uses the results of Phase I to find the optimal solution to the original LPP using the simplex method. The two-phase method handles cases where the original LPP is infeasible, feasible with an objective of 0, or feasible with artificial variables at 0 leading to the optimal feasible solution.

Uploaded by

Archit Madaan
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

Optimization

Techniques
(Two Phase Method)

Dr. Meenakshi Rana


Associate Professor
mrana@thapar.edu
Two–Phase Method
Phase I: Introduce additional objective function in place of the given objective
function, the new LPP formed is called Auxiliary LPP.
The auxiliary LPP: Minimize Z* = a1+ a1+………+ar (ai-artificial variables)
subject to the constraints of the original (given)LPP:
Solve the above LPP with usual simplex algorithm: Following three cases may arise:
• Case 1. Minimize Z* > 0, and artificial variable remain in the basis with
positive value. Then the LPP has no solution or have Infeasible solution.
• Case 2. Minimize Z* =0, and no artificial variable remain in the basis.
Then the LPP has feasible solution and go to Phase II.
• Case 3. Minimize Z* =0, and artificial variable remain in the basis at zero
level. Then the LPP has feasible solution and go to Phase II.
Phase II: Use the last table of Phase-I and find new z-row with original
objective function. Do simplex iteration if required to find optimal
solution.

You might also like