Beruflich Dokumente
Kultur Dokumente
: 6d
Solve the following LPP by
i.
Graphical method (if possible)
ii.
Dual simplex method
iii.
Two phase method
iv.
Solve its dual by simplex method
v.
Solve its dual by graphical method
vi.
Solve its dual by dual simplex method
Min Z=2x1 + 3x2
Subject to
2x1 x2 x3 3
x1 x2 + x3 2
x1 ,x2 ,x3 0
Answer:
i.
ii.
X3
S1
S2
RHS
0
1
2
Z
S1
S2
1
0
0
2
(-2)
-1
3
1
1
0
1
-1
0
1
0
0
0
1
0
-3
-2
0
1
Z
X1
1
0
0
1
4
-1/2
1
-1/2
1
-1/2
0
0
-3
3/2
S2
1/2
(-3/2)
-1/2
-1/2
0
1
2
Z
X1
X3
1
0
0
0
1
0
13/3
-2/3
-1/3
0
0
1
2/3
-1/3
1/3
2/3
-1/3
-2/3
-10/3
5/3
1/3
Phase-I
Introducing artificial variable & rewriting
Min Z=2x1 + 3x2
2x1 x2 x3-s1+A1=3
1
x1 x2 + x3 -s2+A2=2
2
Objective function including only artificial variables is
Min A=A1+A2
ie
Max A= -A1-A2
A+A1+A2=0
0
Comment
Eqn B.V
No.
Coefficients of
A
X1
X2
X3
A1
A2
S1
S2
RHS
Ratio
0
1
2
A
A1
A2
1
0
0
0
2
1
0
-1
-1
0
-1
1
1
1
0
1
0
1
0
-1
0
0
0
-1
0
3
2
R1=>R1-R2
0
1
2
A
A1
A2
1
0
0
-2
2
1
1
-1
-1
1
-1
1
0
1
0
1
0
1
1
-1
0
0
0
-1
-3
3
2
R1=>R1-R3
0
1
2
A
A1
A2
1
0
0
-3
(2)
1
2
-1
-1
0
-1
1
0
1
0
0
0
1
1
-1
0
1
0
-1
-5
3
2
5/3
3/2
2
0
1
2
A
X1
A2
1
0
0
0
1
0
1/2
-1/2
-1/2
-3/2
-1/2
(3/2)
3/2
1/2
-1/2
0
0
1
-1/2
-1/2
1/2
1
0
-1
-1/2
3/2
1/2
1/3
-3
1/3
0
1
2
A
X1
X3
1
0
0
0
1
0
0
-2/3
-1/3
0
0
1
1
1/3
-1/3
1
1/3
2/3
0
-1/3
1/3
0
-1/3
-2/3
0
5/3
1/3
Phase II
Actual objective function is
Max Z= -Z= -2x1 - 3x2
Z+2x1+3x2=0
R1=>R1-2R2
Eqn
No.
0
1
2
B.V
Z
X1
X3
Coefficients of
Z
X1
1
2
0
1
0
0
0
1
2
X2
3
-2/3
-1/3
X3
0
0
1
S1
0
-1/3
1/3
S2
0
-1/3
-2/3
0
5/3
1/3
Z
X1
X3
1
0
0
13/3
-2/3
-1/3
0
0
1
2/3
-1/3
1/3
2/3
-1/3
-2/3
-10/3
5/3
1/3
0
1
0
From table,
Z= -10/3
Z= -(-10/3)=10/3
X1=5/3 , X2=0 , X3=1/3
iv.
Primal is
Min Z=2x1 + 3x2
Subject to
2x1 x2 x3 3
x1 x2 + x3 2
x1 ,x2 ,x3 0
Dual is
Max Z*=3y1+2y2
Subject to
2y1+y2 2
-y1-y2 3
-y1+y2 0
y1 , y2 0
Z*-3y1-2y2=0
2y1+y2+s1=2
-y1-y2+s2=3
0
1
2
RHS
-y1+y2+s3=0
Eqn
No.
B.V
0
1
2
3
Coefficients of
Z*
Y1
Y2
S1
S2
S3
RHS
Ratio
Z*
S1
S2
S3
1
0
0
0
-3
(2)
-1
-1
-2
1
-1
1
0
1
0
0
0
0
1
0
0
0
0
1
0
2
3
0
1
-3
0
0
1
2
3
Z*
Y1
S2
S3
1
0
0
0
0
1
0
0
-1/2
1/2
-1/2
(3/2)
3/2
1/2
1/2
1/2
0
0
1
0
0
0
0
1
3
1
4
1
2
-8
2/3
0
1
2
3
Z*
Y1
S2
Y2
1
0
0
0
0
1
0
0
0
0
0
1
5/3
1/3
2/3
1/3
0
0
1
0
1/3
-1/3
1/3
2/3
10/3
2/3
13/3
2/3
v.
Dual is
Max Z*=3y1+2y2
Subject to
2y1+y2 2
-y1-y2 3
-y1+y2 0
y1 , y2 0
Constraint equations are
2y1+y2 = 2
1
-y1-y2 =3
2
-y1+y2 = 0
3
Line 1
Line 2
Line 3
By drawing graph we get the feasible region as OABC (See Fig. below) with corner points
O(0,0) , A(0,1) , B(2/3,2/3) , C(1,0)
vi.
If we multiply the constraint equations of dual LPP by (-1) to get a negative sign in the RHS,
the constraint equations changes into ( ) type. Hence we cant solve it by dual simplex method