{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 9B - Desk Problem An LP Paradigm max c t x Ax = b...

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

View Full Document Right Arrow Icon
EE103 Lec 9B (SEJ) 1 Desk Problem: An LP Paradigm D 1 D 2 D 3 D 4 Carpentry shop 4 9 7 10 Finishing shop 1 1 3 40 6,000 labor hours 4,000 labor hours D 1 D 2 D 3 D 4 Profit 12 20 18 40 1 2 3 4 1 2 3 4 1 2 3 4 max12 20 18 40 . . 4 9 7 10 6000 3 40 4000 0, 1,...,4 i x x x x s t x x x x x x x x x i + + + + + + + + + = max 0 t c x Ax b x = EE103 Lec 9B (SEJ) 2 1 2 3 4 12 20 18 40 z x x x x = + + + max 0 0 0 0 1 2 3 4 4 9 7 10 0 6000 1 2 3 4 3 40 0 4000 1 2 3 4 12 20 18 40 0 1 2 3 4 0, 1,...,6 x x x x z x x x x z x x x x z x x x x z x i i + + + + + + + + + + + + + + + = = We’ll put this LP problem in a form that’s Suitable to implement the Simplex Algorithm Desk Problem: An LP Paradigm
Image of page 1

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

View Full Document Right Arrow Icon