This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 3. 3.4.17 (9 th ) 3.4.15 (8 th ) 4. 4.3-2 (Version 8) 4.3-3 (Version 9) (a) Work through the simplex problem by hand to solve this problem (b) Repeat part (a) with the corresponding interactive routine in your IOR Tutorial (c) Verify the optimal solution you obtained by using a software package based on the simplex method. Max Z=x1 + 2x2 subject to (1) x1 + 3x2 <=8 (2) x1 + x2 <=4 (3) x1>=0 (4) x2>=0...
View Full Document
- Fall '08