COMP 482, Fall 2008 Assignment 9: Linear Programming Solutions and Conditions, Assignments of Algorithms and Programming

Download COMP 482, Fall 2008 Assignment 9: Linear Programming Solutions and Conditions and more Assignments Algorithms and Programming in PDF only on Docsity! COMP 482, Fall 2008, Assignment 9 1. (10 points) [CLRS] 29.5-5 Solve the following linear program using SIMPLEX: maximize x1 + 3x2 subject to −x1 + x2 ≤ −1 −2x1 − 2x2 ≤ −6 −x1 + 4x2 ≤ 2 x1, x2 ≥ 0. Show each dictionary and describe each pivot and other major steps. 2. (15 points) Find necessary and sufficient conditions for the numbers s and t to make the LP problem maximize x1 + x2 subject to sx1 + tx2 ≤ 1 x1, x2 ≥ 0. (a) have an optimal solution, (b) be infeasible, (c) be unbounded. 1