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: UIUC MATH 482 Practice final problems (Spring 2011) The actual final exam will ask you to solve ten of twelve problems, each worth 10 points. I will focus on material in the lectures, in class exercises, homeworks and other material presented in class. The actual final exam may either include or exclude problems similar to the ones below. 1. Let G be a graph. A subset S of the vertices is called independent if no two vertices in S are adjacent. Formulate an integer linear program that finds a maximum-size independent set. 2. Solve the following linear program. min 2 x 1 − 3 x 2 = z subject to x 1 + x 2 ≥ − x 1 +2 x 2 ≥ − 2 x 1 , x 2 ≥ 3. Let P be the following linear program. min x 1 +4 x 2 − 2 x 3 subject to x 1 − x 2 = 2 x 1 +3 x 2 + x 3 = 4 x 1 , x 2 , x 3 ≥ Form the dual linear program D of P . Solve D . What does the optimal solution of D tell you about an optimal solution of P ?...
View Full Document
This note was uploaded on 02/19/2012 for the course MATH 482 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.
- Spring '08