{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Linear Prog COP4355_Part_9

# Linear Prog COP4355_Part_9 - Chapter 4 Linear Programming...

This preview shows pages 1–3. Sign up to view the full content.

40 Chapter 4 Linear Programming: The Simplex Algorithm 4.8 (continued) Initial Tableau A B C S1 S2 S3 S4 S5 S6 A6 S7 A7 S8 A8 Cj 100 5 25 0 0 0 0 0 0 - M 0 - M 0 - M Bi Θ S1 0 7 5 6 1 0 0 0 0 0 0 0 0 0 0 130 18.57 S2 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 20 20 S3 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 50 + S4 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 30 + S5 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 30 30 A6 -1 M 1 0 0 0 0 0 0 0 -1 1 0 0 0 0 5 5 A7 -1 M 0 1 0 0 0 0 0 0 0 0 -1 1 0 0 5,000 + A8 -1 M 0 0 1 0 0 0 0 0 0 0 0 0 -1 1 5 + Zj -M - M - M 0 0 0 0 0 M - M M - M M - M -5,010 M Zj 100+ M 5+ M 25+ M 0 0 0 0 0 - M 0 - M 0 - M 0 Entering: A Leaving: Artificial 6 4.9 We can set up the problem for weekly production, daily production, or hourly production. We have chosen the hourly approach, and we will multiply by 40 to get the weekly results: if we chose the daily level, we would multiply the results by 5. MAX Z: 4T + 2R Subject to: T + 2R 4 T + R 2 (T, R 0)

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

View Full Document
Solutions Manual and Workbook 41 4.9 (continued) Initial Tableau T R S1 S2 A2 Cj 4 2 0 0 - M Bi Θ S1 0 1 2 1 0 0 4 4 A2 - M 1 1 0 -1 1 2 2 Zj
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

Linear Prog COP4355_Part_9 - Chapter 4 Linear Programming...

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

View Full Document
Ask a homework question - tutors are online