handout05 - 2 ≥ 2 max 3 x 1 4 x 2-x 3 s.t 4 x 1-2 x 2 3 x...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
IEOR 162 Linear Programming Spring 2007 Discussion Section Handout 5 Solve the following using the Simplex method: 1. max 5 x 1 + 3 x 2 s.t. x 1 + 2 x 2 3 2 x 1 + x 2 3 x 1 , x
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2 ≥ 2. max 3 x 1 + 4 x 2-x 3 s.t. 4 x 1-2 x 2 + 3 x 3 ≤ 10 x 1 + 4 x 2-2 x 3 ≤ 8 x 1 , x 2 , x 3 ≥ 1...
View Full Document

This note was uploaded on 04/02/2008 for the course IEOR 162 taught by Professor Zhang during the Spring '07 term at Berkeley.

Ask a homework question - tutors are online