ISYE 323

ISyE323: Operations Research—Deterministic Models Problem Set #9 Due: December 5 The homework answers should be brought to class on 12/5. There will not be a quiz associated with this homework Deliverables: • Writeup (on paper) for each problem 1 Unbounded LP 1-1 Problem Using the simplex method show that the following linear program is unbounded. max 2x1 − 3x2 − x3 s.t.x2 − x3 ≤ 6 −x1 − x3 ≤ 10 x1, x2 ≥ 0 x3 free Answer: Since x3 is free, we need to do the subs...