Question Paper 15th April 2007 Using Simplex Method, solve following LP Problem Maximize Z = 8X1 + 6X2 Subject

t to x1 + 3x2 2 4x1 + 2x2 3 2x1 1 x1, x2 0 Add slack variable S1, S2 & S3 to the constraints for equality and cost for S1, S2 & S3 is 0. Standard Form of LPP Zmax = 8x1 + 6x2 + 0 S1 + 0S2 + 0S3 Subject to x1 + 3x2 + S1 + 0S2 + 0S3 = 2 4x1 + 2x2 + 0S1 + S2 + 0S3 = 3 2x1 + 0x2 + 0S1 + 0S2 + S3 = 1 x1, x2, S1, S2 & S3 0 We have 5 Variables and 3 Constraints i.e. 5-3 = 2 Therefore x1=0, x2=0, S1=2, S2=3 & S3=1 Initial Iteration CB YB 0 S1 0 S2 0 S3 Zj Zj-Cj Cj XB 2 3 1 0 8 x1 1 4 2 0 -8 6 0 0 0 x2 S1 S2 S3 3 1 0 0 2 0 1 0 0 0 0 1 0 0 0 0 -6 0 0 0

= XB/aic , aic > 0

2/1 = 2 = 0.75 = 0.5

How to calculate Zj Zj with respect to XB = (2x0) + (3x0) + (1x0) = 0

Numbers in the XB Column

Numbers in the CB Column Similarly Zj to be found out for all other columns as per above typical calculation. If all Zj-Cj 0 solution is Optimal, but in this solution it is not Optimal, since it is less than zero ve Choose most Zj-Cj. In this solution -8.

Select leaving variable (key row)

min = XB/aic , aic > 0 min = = 0.5

S3 drop out Key Element: Intersection of Key row and Key column

i.e. 2 x1 introduced and S3 drop out Revised key row of x1 = Old key row / key element XB x1 x2 S1 S2 S3 2/2 0 0/2 0/2 1/2 0.5 1 0 0 0 0.5 Other revised row of S1 = Old row (Corresponding key column co-efficient x Revised key row co-efficient) XB = 2-(1 x ) = 3/2 x1 = 1-(1 x 1) = 0 x2 = 3-(1 x 0) = 3 S1 = 1-(1 x 0) = 1 S2 = 0-(1 x 0) = 0 S3 = 0-(1 x ) = - Other revised row of S2 = Old row (Corresponding key column co-efficient x Corresponding key row co-efficient) XB = 3-(4 x ) = 1 x1 = 4-(4 x 1) = 0 x2 = 2-(4 x 0) = 2 S1 = 0-(4 x 0) = 0 S2 = 1-(4 x 0) = 1 S3 = 0-(4 x ) = -2

1st Iteration CB 0 0 8 Zj YB S1 S2 x1 Cj XB 3/2 1 4 8 x1 0 0 1 8 6 x2 3 2 0 0 0 0 0 S1 S2 S3 1 0 - 0 1 -2 0 0 0 0 4

= XB/aic , aic > 0

(3/2) / 3 = 0

-6 0 0 4 If all Zj-Cj 0 solution is Optimal, but in this solution it is not Optimal, since it is less than zero ve Choose most Zj-Cj. In this solution -6. Select leaving variable (key row)

Zj-Cj

min = XB/aic , aic > 0 min = = 0.5

S2 drop out Key Element: Intersection of Key row and Key column

i.e. 2 x2 introduced and S2 drop out Revised key row of x2 = Old key row / key element XB x1 x2 S1 S2 S3 0/2 2/2 0/2 -2/2 0 1 0 -1 Other revised row of S1 = Old row (Corresponding key column co-efficient x Corresponding key row co-efficient) XB = 3/2-(3 x ) = 0 x1 = 0-(3 x 0) = 0 x2 = 3-(3 x 1) = 0 S1 = 0-(3 x 0) = 0 S2 = 0-(3 x 0) = 0 S3 = --(3 x -1) = 5/2 Other revised row of x1 = Old row (Corresponding key column co-efficient x Corresponding key row co-efficient) XB = -(0 x ) = x1 = 1-(0 x 0) = 1 x2 = 0-(0 x 1) = 0 S1 = 0-(0 x 0) = 0 S2 = 0-(0 x 0) = 0 S3 = -(0 x -1) =

2nd Iteration Cj 8 6 0 0 0

S3 = XB/aic , aic > 0 5/2 0/(5/2) = 0 -1 () / -1 = - () / () = 1 -2 -2 If all Zj-Cj 0 solution is Optimal, but in this solution it is not Optimal, since it is less than zero ve Choose most Zj-Cj. In this solution -2. Select leaving variable (key row) CB YB 0 S1 6 x2 8 x1 Zj Zj-Cj XB 0 7 x1 0 0 1 8 0 x2 0 1 0 6 0 S1 0 0 0 0 0 S2 0 0 0 0 0

min = XB/aic , aic > 0 min = 0 / (5/2) = 0

S1 drop out Key Element: Intersection of Key row and Key column

i.e. 5/2 S3 introduced and S1 drop out Revised key row of S3 = Old key row / key element XB x1 x2 S1 S2 S3 0 / (5/2) 0/ (5/2) 0/ (5/2) 0/ (5/2) 0/ (5/2) (5/2) / (5/2) 0 0 0 0 0 1 Other revised row of x1 = Old row (Corresponding key column co-efficient x Corresponding key row co-efficient) XB = -( x 0) = x1 = 1-( x 0) = 1 x2 = 0-( x 0) = 0 S1 = 0-( x 0) = 0 S2 = 0-( x 0) = 0 S3 = -( x 1) = 0 Other revised row of x2 = Old row (Corresponding key column co-efficient x Corresponding key row co-efficient) XB = -(-1 x 0) = x1 = 0-(-1 x 0) = 0 x2 = 1-(-1 x 0) = 1 S1 = 0-(-1 x 0) = 0 S2 = 0-(-1 x 0) = 0 S3 = -1-(-1 x 1) = 0 3rd Iteration

CB YB 0 S1 6 x2 8 x1 Zj Zj-Cj

Cj XB 0 7

8 x1 0 0 1 8 0

6 x2 0 1 0 6 0

0 0 0 S1 S2 S3 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0

= XB/aic , aic > 0

Since all Zj-Cj 0, Zmax = 7 Z min = -7 x1 = , x2 =

Solution is Optimal.

Substitute the value of x1 & x2 in the above equation Z = 8() + 6() =7 Subject to + 3() = 2 2 4() + 2() = 3 3 2() = 1 1