Q. 2. Solve the below LP using SIMPLEX method. Maximize subject to −x1−x2+4x3x1+x2+2x3≤9x1+x2−x3≤2−x1+x2+x3≤4x1,x2,x3≥0.
Set up simplex tableau: Set up the initial simplex tableau with slack variables to convert inequalities to equations.Add slack variables s1, s2, and s3 to the constraints.Objective function: −x1−x2+4x3 becomes −x1−x2+4x3+0s1+0s2+0s3.Constraints:x1+x2+2x3+s1=9,x1+x2−x3+s2=2,−x1+x2+x3+s3=4.
Identify entering and leaving variables: Identify the entering variable (most negative coefficient in the objective function row) and the leaving variable (smallest positive ratio of RHS to the coefficient of entering variable in the constraint rows).Entering variable: x3 (coefficient 4 in z-row).Leaving variable: s2 (smallest positive ratio of 2 to −1 in row 2).
Perform pivot operation: Perform pivot operation to make x3 the basic variable in place of s2. Pivot on the element at the intersection of the entering column (x3) and the leaving row (s2).