{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw3 - You may have several choices for variables...

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

CO 227 - Homework assignment 3 Fall ‘10 Page 1 CO 227 - Fall ‘10 Homework assignment #3: (Due at Monday, Oct 18th, at 4pm) Instructions: Please show all your work and justify your answers. Answers without proper justification will not be considered. Please list who you collaborated with. Please staple your homework and write your name and student id in pen. Total value = 100 points Question 1 - Simplex method (100 points) Consider the following feasible LPs. For each of them, either obtain an optimal solution by providing a certificate of optimality or show that the LP is unbounded by providing a certificate of unboundedness. Show all your work by rewriting the LP in canonical form at each step. You may have several choices for variables entering/leaving the basis. However, to make
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: You may have several choices for variables entering/leaving the basis. However, to make the correction easier, if there is a choice, always choose the lowest index variable. If you do not do that, you will be penalized. (a) (50 points) max z ( x ) = (1 , 4 ,-1 , 3 , , 0) x s.t. p 1-2 3 2 1 2-1-2 1 P x 1 x 2 x 3 x 4 x 5 x 6 = p 1 1 P x ≥ v (1) Start with the basis B = { 5 , 6 } . (b) (50 points) max z ( x ) = (1 , 4 , 1 , 3 , 1) x s.t. p 1 1 3 1 2 2 1 1 1 P x 1 x 2 x 3 x 4 x 5 = p 6 2 P x ≥ v (3) Start with the basis B = { 2 , 5 } ....
View Full Document

{[ snackBarMessage ]}