This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CO 350 Assignment 6 – Winter 2009 Due: Friday March 13 at 10 a.m. Solutions are due in drop box #2 , outside MC 4066 by the due time: Slot #9 (AF), Slot #10 (GL), Slot #11 (MR), Slot #12 (SZ). Write your name, ID# and Section# clearly. Marks will be deducted if any of this info is missing or incorrect. Section 1: J. Cheriyan, TTh 1011:20 a.m. Section 2: E. Teske, MWF 10:3011:20 a.m. Please acknowledge all outside sources, help and collaboration in your submission. Policy for marking complaints : If you have any complaints about the marking of assignments or the midterm exam, then you should first check your solutions against the posted solutions. After that, if you see any marking error, then you should return the assignment (or exam) to your instructor within one week and with written notes on all the marking errors; you may write the notes on the first/last page or else attach a separate sheet. Computations with the simplex method : Clearly show the details of each iteration. In particular, each tableau should be presented as in the course notes. ( ⋆ ) Reading : Read Chapters 7 and 8, before attempting the exercises. 1. Exercise 7.7.2 from the course notes. 2. Exercise 7.7.4 from the course notes, which is reproduced here: Solve the following LP problem by the twophase simplex method: ( P ) max z = 5 x 1 − 2 x 2 + x 3 subject to x 1 + 4 x 2 + x 3 ≤ 6 2 x 1 + x 2 + 3 x 3 ≥ 2 x 1 , x 2 ≥ , x 3 free Hint : Observe that x 3 is a free variable and the simplex method (the version studied in CO350) applies only to LPs in standard equality form. 3. (a) Solve the following LP problem (P) by the twophase method. Use the smallest subscript rule for the entering variable....
View
Full Document
 Spring '07
 S.Furino,B.Guenin
 Linear Programming, Optimization, J. Cheriyan

Click to edit the document details