handout01 - 2 ≥ 2 min 3 x 1 2 x 2 s.t 1 4 x 1 1 5 x 2 ≥...

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 1 Solve the following graphically: 1 . max x 1 + x 2 s.t. x 1 + 2 x 2 4 x 1 - 2 x 2 0 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 . min 3 x 1 + 2 x 2 s.t. 1 4 x 1 + 1 5 x 2 ≥ 1 1 8 x 1 + 1 2 x 2 ≥ 1 x 1 , x 2 ≥ 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