This preview shows pages 1–3. 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 Test 2 (Spring 2011) Instructions: • This test has 7 pages including this cover sheet. • Answer 4 of the 5 problems given below. (I will grade all 5 problems and score you on the best 4.) • Each problem is scored out of 5 points. • This test is out of 20 points. • Justify all of your steps to ensure full credit. • No calculators or other aids are permitted. • Write your name and ID below and on every page. • Make your student ID available. NAME: STUDENT ID: 1 2 Q1. Use the dual simplex algorithm to solve the following linear pro- gram. min 4 x 1 + x 2 + x 3 = z subject to x 1 + x 2- 2 x 3 ≥ 1 2 x 1- x 2 ≥ 1 x 1 , x 2 , x 3 ≥ Solution: Note that surplus variables must be added to convert the problem to standard form, and that these surplus variables nicely form a starting basis. Note that they do not correspond to a basic feasible solution, however. Since all of the cost coefficients are nonnegative, the dual simplex is the right algorithm to use here.dual simplex is the right algorithm to use here....
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