Professional Documents
Culture Documents
Linear Program Problems
Linear Program Problems
21 +3x 2 So
caficinte
X2 SL S3 RHS Rato
2 -4
2
ooo
4 50 50|1 = 50
S2 2 too!
S3 2:3
2 200
SI 8|5 -175 3o
2 al5 75 20
S3 315 30
Example5: Using enalty (Big M) dnd Duality
method solve the
Minimise z= X4 + 2x2 + X3 following L.PP.
1 1
subjectto +
23 S1
1+2x2 +Xg 2 8
X4, X2, X3 20.
(M.U. 2001)
problem is of
Sincethe given minimisation type we convert it into
Sol
Maximize z'=-Z = X1 - 2x2 - X3. maximisation type.
We have
Maximise z'=-X- 2X2 - X3 - 0s4 -0s, - MA,
(1)
subject to X4 t5X2 5xs +S +Os, +0Az=1 (2)
3
X+ 2x2 + X3 +0s - S + A, =8 (3)
Mutiply (3) by Mand add to (1).
z'
1-M
2
2-2M 1 M M0 -8M
s, leaves S 2
1 1/2* 1/2 1
X,enters Ag 3/2 2 1 0 -1 1 4 4
2 0 0 2
1 1 2
Az - 5/2 1
AieSince all -1 -4 -1
values enThtreies givenin the row of z are positive (M is a big positive number) A, appears with a
1 N
-1/2 -1/2 0 1
1 1/2 - 1/2 0 1
1/2 1/2 1 -2 <
Ratio
-1 -1
Since S2 rOw is negative, s, feasibe
solution. leaves, But since all ratios are negative, the L.P.P. has no
negative,