Scribd
Upload
39 views13 pages

MAT331-Operation Research Lab: Two Phase Simplex Method

This document discusses the two phase simplex method for solving linear programming problems with non-basic feasible solutions. It explains that the two phase method first constructs an auxiliary problem in Phase I to find a basic feasible solution, then optimizes the original objective in Phase II. Step-by-step instructions and examples are provided to illustrate how to apply the two phase simplex method to express problems in standard form and solve them.

Uploaded by

hirechish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
39 views13 pages

MAT331-Operation Research Lab: Two Phase Simplex Method

This document discusses the two phase simplex method for solving linear programming problems with non-basic feasible solutions. It explains that the two phase method first constructs an auxiliary problem in Phase I to find a basic feasible solution, then optimizes the original objective in Phase II. Step-by-step instructions and examples are provided to illustrate how to apply the two phase simplex method to express problems in standard form and solve them.

Uploaded by

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

MAT331-Operation Research Lab

TWO PHASE SIMPLEX METHOD

Dr. S. V. Gomathi
Assistant Professor
Department of Mathematics
SASTRA Deemed University
Thanjavur-Dt

1
When we apply two phase method to solve the linear
programming problem?

If there is any constraint with = or ≥ sign , then we can use two-phase
method.
We first express the given LPP in standard form by introducing the
slack, surplus and artificial variables. Then, we set down the two
phases as follows

2
Steps for Two-Phase Method:
Phase I – In this phase, the simplex method is applied to a specially
constructed auxiliary linear programming problem leading to a final
simplex table containing a basic feasible solution to the original
problem.
• Step 1 – Assign a cost -1 to each artificial variable and a cost 0 to all
other variables in the objective function.
• Step 2 – Construct the Auxiliary LPP in which the new objective
function Z* is to be maximized subject to the given set of constraints.
• Step 3 – Solve the auxiliary problem by simplex method until either of
the following cases arise 3
a) Max Z* < 0 and atleast one artificial vector appear in the optimum
basis at a positive level (Δj ≥ 0). In this case, given problem does not
possess any feasible solution.

b) Max Z* = 0 and at least one artificial vector appears in the optimum


basis at a zero level. In this case proceed to phase-II.

c) Max Z* = 0 and no one artificial vector appears in the optimum


basis. In this case also proceed to phase-II.

4
• Phase II – Now assign the actual cost to the variables in the
objective function and a zero cost to every artificial variable
that appears in the basis at the zero level. This new objective
function is now maximized by simplex method subject to the
given constraints.

5
• Example 1
Max Z = 3x1 - x2
s.t
2x1 + x2 ≥ 2,
x1 + 3x2 ≤ 2,
x2 ≤ 4,
and x1 ≥ 0, x2 ≥ 0

6
7
8
9
Solve the LPP using two phase simplex method

Solution is

10
3) Min (Z)= 6x+21y
Subject to
X+2y>=3,
X+4y>=4,
X,y>=0.

Min(Z)=22.5 at x=2, y=0.5.

11
4. Max(Z)= 2x1+3x2+4x3
subject to
3x1+2x2+x3<=10,
2x1+3x2+3x3<=15,
x1+x2-x3>=4
and x1,x2,x3>=0.

Max(Z)=15.556 at x1=0.33, x2=4.22, x3=0.556.

12
4. Max(Z)= 5x1+2x2+10x3
subject to
x1-x3<=10,
x2+x3>=10,
and x1,x2>=0.

Min(Z)=20 at x1=0, x2=10, x3=0

13

You might also like