This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 573: Graduate Algorithms, Fall 2010 Homework 5 Practice only — Do not submit solutions 1. (a) Describe how to transform any linear program written in general form into an equivalent linear program written in slack form. maximize d ∑ j = 1 c j x j subject to d ∑ j = 1 a ij x j ≤ b i for each i = 1 .. p d ∑ j = 1 a ij x j = b i for each i = p + 1 .. p + q d ∑ j = 1 a ij x j ≥ b i for each i = p + q + 1 .. n Z = ⇒ max c · x s.t. Ax = b x ≥ (b) Describe precisely how to dualize a linear program written in slack form. (c) Describe precisely how to dualize a linear program written in general form. In all cases, keep the number of variables in the resulting linear program as small as possible. 2. Suppose you have a subroutine that can solve linear programs in polynomial time, but only if they are both feasible and bounded. Describe an algorithm that solves arbitrary linear programs in polynomial time. Your algorithm should return an optimal solution if one exists; if no optimumpolynomial time....
View
Full
Document
This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.
 Fall '08
 Chekuri,C
 Algorithms

Click to edit the document details