This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 2008 Homework 8 Linear Programming • Due date: 4:00pm on Monday, November 3, 2008 in the ENGRI 1101 box at the west end of the corridor on the second floor of Rhodes Hall, where it connects to Upson. • Reading assignment: Chapter 3 of Winston and Chapter 2 of Chvatal (included in coursepack). • Make sure to put your name on the first page and staple the problems in order. 1. (20 points) Consider the following 2variable linear program: maximize x + 2 y subject to x ≤ 3; y ≤ 4; x + y ≤ 5; y x ≤ 2; x ≥ 0; y ≥ 0. (a) (5 points) Are any of the constraints redundant (i.e., the feasible region would be unchanged if this constraint were omitted)? Explain your answer. (b) (15) Solve the LP by the graphical method (using graph paper makes this problem easier to do). 2. (40 points) Consider the linear program max 5 x 1 +4 x 2 s.t. 5 x 1 +3 x 2 ≤ 3 5 x 1 +3 x 2 ≤ 18 x 1 ≤ 3 x 1 , x 2 ≥ (a) (20 points) Introduce 3 slack variables, and solve this linear program using the simplex method.(a) (20 points) Introduce 3 slack variables, and solve this linear program using the simplex method....
View
Full
Document
This note was uploaded on 12/25/2009 for the course ENGRI 1101 at Cornell University (Engineering School).
 '05
 TROTTER

Click to edit the document details