Professional Documents
Culture Documents
CONVERTING ALL THE INEQUALITIES INTO EQUATION BY INTRODUCING SLACK VARIABLES S1, S2 AND S3. WE GET, 2X1 + X2 + S1 . =50 . 2X1+5X2 . + S2 . =100 1 2X1+3X2 . + S3 =90 . AND X1, X2,S1, S2, S3 0.
THUS THE GIVEN LPP IS CONVERTED INTO MATRIX FORM MAX Z = 4X1+10X2+0.S1+0.S2+0.S3
SUBJECT TO CONSTRAINTS
2 2
1 5
1 0
0 1 0 0 0
0 0
2 0
4
3 0
10
0 0
0
1 0
0
0 1 5 1
1 -1/5 0 0 1/5 1
0 0
3 0 10
0
0 -3/5 0 0
0 2 -2
1 0
0
4
0
ILLUSTRATION 2 SOLVE THE FOLLOWING LPP BY SIMPLEX METHOD MIN Z = X -3X +2X
1 2 3
SUBJECT TO CONSTRAINTS
WHERE Z = -Z
CONVERTING ALL THE INEQUALITIES INTO EQUATION BY INTRODUCING SLACK VARIABLES S1, S2 AND S3. WE GET,
3X1- X2 +2X3 +S1 . =7 . -2X1+4X2+0.X3 . +S2 . =12 -4X1+3X2+8X3 . +S3 =10 . AND X1, X2, X3, S1, S2, S3 0.
3 -2
-1 4
2 0 8 0 -2
1 0
0 1 0 0 0
0 0
-4 0
-1
3 0
3
0 0
0
1 0
0
4 1
-1 -1/2 -2 1 4
2 0 8 0 -2
1 0
0 0 1/4 0 0 1 3/4 0
-5/2 -4 -3/2
1/2
0 3
1 0 -3/4 0 0
0 -3/4 0
3
0
Since all
4 5 4 1
1 0 -1/2
0 -5/2 -1
0
1 -3/4 -1/2 0
-1/5 -4/5
1
0
SOLUTION
INTRODUCING SURPLUS AND SLACK VARIABLES S1& S2 AND ARTIFICIAL VARIABLES A1 & A2, THE SET OF CONSTRAINTS BECOMES.
ASSUMING LARGE NEGATIVE PRICE M TO EACH ARTIFICIAL VARIABLES, THE GIVEN LPP CAN BE WRITTEN AS
B
1
CB
XB
X1 3 4 1
-7M
7M-2
X2 1 3 2
-4M
4M-1
S1 0 -1 0
M -M
S2 0 0 1
0
0
A1 1 0 0
-M
0
A2 0 1 0
-M 0
-2
0
-5M/3-2/3
M
-M
0 0
M
0
5M/3
-1/3
Since all
-2
0
-1
0
1/5
-1/5 0
Since all