1.★ Final term Fall 2004Lecture 2310 marks
Consider the problem: maximize z = x1 + 5x2 + 3x3 subject to x1 + 2x2 + x3 = 3; 2x1 - x2 = 4; x1, x2, x3 >= 0. The variable x3 plays the role of a slack. Use big M-method to solve the problem.
Show answerJawab dekhein
Add artificial R in the 2nd constraint: Max z = x1 + 5x2 + 3x3 - MR; x1 + 2x2 + x3 = 3; 2x1 - x2 + R = 4. Initial basis x3 = 3, R = 4. Substituting x3 = 3 - x1 - 2x2 and R = 4 - 2x1 + x2 in the objective gives z = (9 - 4M) + (2M - 2)x1 - (M + 1)x2, so the Z-row entries (zj - cj) are x1: -(2M - 2), x2: M + 1, RHS 9 - 4M. Iteration 1: x1 enters (most negative zj - cj = -(2M - 2)). Ratios: x3 row 3/1 = 3, R row 4/2 = 2 -> R leaves, pivot 2. New R-row: x1 - 1/2 x2 + 1/2 R = 2. New x3-row: 5/2 x2 + x3 - 1/2 R = 1. Z-row: z = 5 - 2x2 - (M - 1)R, i.e. zj - cj for x2 = 2 >= 0 and for R = M - 1 >= 0. All zj - cj >= 0, so optimal: x1 = 2, x2 = 0, x3 = 1, maximum z = 5. Check: 2 + 0 + 1 = 3 and 4 - 0 = 4.
2.★ Final term Fall 2006Lecture 2310 marks
Solve the following problem with Big M - Method. Minimize Z = 3X1 + 2X2 + X3 subject to X1 + X2 = 7; 3X1 + X2 + X3 >= 10; X1, X2, X3 >= 0
Show answerJawab dekhein
Standard form: Min Z = 3x1 + 2x2 + x3 + MR1 + MR2; x1 + x2 + R1 = 7; 3x1 + x2 + x3 - s2 + R2 = 10. Initial basis R1 = 7, R2 = 10. Z-row (zj - cj): x1 4M-3, x2 2M-2, x3 M-1, s2 -M, Z = 17M. Iteration 1: x1 enters (largest positive 4M-3). Ratios R1 7/1 = 7, R2 10/3 = 3.33 -> R2 leaves. New x1-row: x1 + 1/3 x2 + 1/3 x3 - 1/3 s2 = 10/3. R1-row: 2/3 x2 - 1/3 x3 + 1/3 s2 + R1 = 11/3. Z-row: x2 (2M-3)/3, x3 -M/3, s2 (M-3)/3, Z = (11M + 30)/3. Iteration 2: x2 enters. Ratios x1-row (10/3)/(1/3) = 10, R1-row (11/3)/(2/3) = 5.5 -> R1 leaves. New x2-row: x2 - 1/2 x3 + 1/2 s2 = 11/2. x1-row: x1 + 1/2 x3 - 1/2 s2 = 3/2. Z-row: x3 -1/2, s2 -1/2, artificials negative, Z = 15.5. All zj - cj <= 0, so optimal: x1 = 3/2 = 1.5, x2 = 11/2 = 5.5, x3 = 0, Minimum Z = 3(1.5) + 2(5.5) = 15.5. Check: 1.5 + 5.5 = 7; 4.5 + 5.5 + 0 = 10 >= 10.