Linear Prog COP4355_Part_7

Linear Prog COP4355_Part_7 - 32 Chapter 3 Linear...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
32 Chapter 3 Linear Programming: Graphical Analysis
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Solutions Manual and Workbook 33 Chapter 4 Linear Programming: The Simplex Algorithm 4.1 MAX Z: 8X + 6Y + 0S 1 + 0S 2 Subject to: 6X + 12Y + 1S 1 + 0S 2 = 72 5X + 2Y + 0S 1 + 1S 2 = 20 (X, Y, S i 0) Initial Tableau X Y Slack 1 Slack 2 Cj 8 6 0 0 Bi Θ Slack 1 0 6 12 1 0 72 12 Slack 2 0 5* 2 0 1 20 4 Zj 0 0 0 0 0 Zj 8 6 0 0 Entering: X Leaving: Slack 2 Tableau 2 X Y Slack 1 Slack 2 Cj 8 6 0 0 Bi Θ Slack 1 0 0 9.60* 1 -1.20 48 5 X 8 1 0.40 0 0.20 4 10 Zj 8 3.20 0 1.60 32.00 Zj 0 2.80 0 -1.60 Entering: Y Leaving: Slack 1
Background image of page 2
34 Chapter 4 Linear Programming: The Simplex Algorithm 4.1 (continued) Optimal Tableau X Y Slack 1 Slack 2 Cj 8 6 0 0 Bi Y 6 0 1 0.10 -0.13 5 X 8 1 0 -0.04 0.25 2 Zj 8 6 0.29 1.25 46 Zj 0 0 -0.29 -1.25 Optimal Solution: X = 2, Y = 5, Z MAX = 46 *The numerical value enclosed by the red square represents the pivot element. 4.2 MIN Z: 8X + 10Y +0S 1 + 0S 2 + MA 1 +MA 2 Subject to: 3X + 6Y - S
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Linear Prog COP4355_Part_7 - 32 Chapter 3 Linear...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online