Step 1of 6 Consider the following linear programming (LP) problem. max 7=3x,+x, subject to 2x,-x, $2 mx tx, <4 x, x, 20 Here #43 aro tho basic variables. Step 2 of 6 First obtain the analog of the LP by adding slack variables *! and *? as, max 2=3x,+4 subject to 2x,-x, +5,=2 ax trts=4 20 Step 3 of 6 Now write the matrix of basic variables and vector b, BV ={x,x,} “( Now write the 8 matrix, [iilStep 4 of 6 To find B" the formula is given below, I ‘ B" =~ [adjoint of matrix B] [| Hence find the adjoint of matrix B and value of the determinant Bas, Adil] [i i] “is, Step 5 of 6 Now write °™ matrix as, cw =B I Now multiply wv and B" as, cw8'=[4 5] Now find the coefficient of “!and *? in the optimal tableau. Coefficient of s, in row 0 = First element of the above matrix =4 Coeffiecient of s, in row 0 = Second element of the above matrix =5 Now find the right hand side of row 0 as, CyB 'b=[4 sii] =28Step 6 of 6 Now find * column of the tableau matrix as, vit) Now find *2 column of the tableau matrix as, “tht lz Now find *! and * column of the tableau as, IT + om] sam Now find the right hand side of the constraints as, oot all {t] Thus optimal tableau is, 2445, 45s, =28 x45 +5, =6 +5, +25, =10