Homework 4

# Homework 4 - 2 Consider the following problem maximize z =-x 1 4 x 2-3 x 1 x 2 ≤ 6 x 1 2 x 2 ≤ 4 x 1 urs x 2 ≥-3(a Convert this LP into the

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

IOE 310 Homework Number 4 Due: October 9, 2007 1. Consider the Linear Programming Problem: Max z = x 1 + x 2 + x 3 x 1 + + x 3 1 x 2 + x 3 1 x 1 0 x 2 0 x 3 0 (a) Show that the CPF solutions of this linear program are: (0 , 0 , 0) T , (1 , 0 , 0) T , (0 , 1 , 0) T , (0 , 0 , 1) T , (1 , 1 , 0) T . (b) Draw the 3-dimensional polyhedron and show its similarities to the “pyramid of Egypt”. (c) Discuss the CPF Solution (0 , 0 , 1) T (i.e. is it degenerate?).
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. Consider the following problem: maximize z =-x 1 + 4 x 2-3 x 1 + x 2 ≤ 6 x 1 + 2 x 2 ≤ 4 x 1 urs x 2 ≥ -3 (a) Convert this LP into the standard form. (b) Solve by the simplex method. 3. Page 214, #17. 4. Page 215, # 19. 5. Page 216, #28. 6. Page 274, # 1. 7. Page 275, #2. 1...
View Full Document

## This homework help was uploaded on 04/02/2008 for the course IOE 310 taught by Professor Saigal during the Spring '08 term at University of Michigan.

Ask a homework question - tutors are online