ere017 Simplex method Print This Solution Close This Solution Find solution using Simplex(BigM) method MAX Z= x1 - 3x2 + 2x3, subject to -2xL + 4x2 <= 12 xl + 3x2 + 8x3 <= 10 and x1,x2,x3>=0 Solution: Problem is Max Z = 1 — 322 + 203 subject to = 2a + 4a <12 — 4% + 3m2 + 8%3<10 and 21, £2, 23 > 0; ‘The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate 1. As the constraint 1 is of type ' < ' we should add slack variable Si 2. As the constraint 2 is of type’ < ' we should add slack variable $2 After introducing slack variables Max Z = 1 — 322 + 203 + 0S; + 0S) subject to — 2m + 422 +S -12 — 4m + 3m2 + 803 + Sp=10 and 2, 22,23, 51, S2 >0 Iteration+1 CG; 1 -3 2 o | o MinRatio B Ce Xp am | m 2, | |S Xe zs Sa 0 12 4 0 1 0 ad 105 8) wih 2 0 10 3 (8) 0 1 e=a7 Z=0 rj 0 0 0 oj] 0 5-4; 1 27 | o]o Positive maximum C — Z; is 2 and its column index is 3. So, the entering variable is zs 5 Minimum ratio is + and its row index is 2. So, the leaving basis variable is S ‘The pivot element is 8 aboutblank 12ere017 Entering = 23, Departing = So, Key Element = 8 Ra(new) = Ry(old) + 8 Ry(new) = Ri(old) Simplex method Iteration-2 Cj 1 2 |) 0 0 MinRatio B Cp Xp 2 cy zs | S| Sy Xs a Sy 0 12 4 0 1 0 _ 5 3 1 as 7 z 1 0 a ~ 5 3 1 2 Z, - 3 - Z=5 5 1 ; 2/0 3 15 1 CO -%, + + 1 — 2; 2t 7 o|o 7 Variable 2; should enter into the basis, but all the coefficients in the 2; column are negative ot zero. So 2 can not be entered into the basis Hence, the solution to the given problem is unbounded. Solution is provided by AtoZmath.com aboutblank 22