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: Spring 2010 CS530 Analysis of Algorithms Homework 6 H OMEWORK 6, DUE M ARCH 17 You must prove your answer to every question. Problems with a ( * ) in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score to them. But I will still note if you solve them. Problem 1 (29.56) . (25pts) Solve the following linear programming prob lem, by the simplex method. (This is the politicians problem we started with.) minimize x 1 + x 2 + x 3 + x 4 subject to 2 x 1 + 8 x 2 + 10 x 4 50, 5 x 1 + 2 x 2 100, 3 x 1 5 x 2 + 10 x 3 2 x 4 25, x 1 , x 2 , x 3 , x 4 0. Solution. The auxiliary variable for the first phase (to find a feasible solu tion) is called x 5 . We muliply by 1 all the inequalities and the objective function, in order to get a standard form. I present the solution as a list of tableaux. The variable numbers appear at the head of their columns for non basic variables (following the number of the column) and at the head of their rows for basic variables (folowing the number of the row). The last two lines are the value (with reversed sign) and the coefficients of the two objective functions: the original one, and the function x 5 . 3 times 5 1 1 2 2 3 3 4 4 5 5 1 650 28101 2 7100521 3 8253 510 2111111 Bringing x 5 into the basis: 3 times 5 1 1 2 2 3 3 4 4 5 7 1 6 50.000 7.0006.000 0.00010.0001.000 2 5 100.000 5.000 2.0000.0000.0001.000 3 8 75.000 2.000 7.00010.000 2.0001.000 0.0001.0001.0001.0001.000 0.000 100.000 5.000 2.000 0.000 0.0001.000 Spring 2010 CS530 Analysis of Algorithms Homework 6 Optimizing the objective function found in the last line. 3 times 5 1 6 2 2 3 3 4 4 5 7 1 1 7.143 0.1430.857 0.0001.4290.143 2 5 64.2860.714 6.2860.000 7.1430.286 3 8 60.7140.286 8.71410.000 4.8570.714 7.143 0.1431.8571.0002.4290.143 64.2860.714 6.286 0.000 7.1430.286 3 times 5 1 6 2 8 3 3 4 4 5 7...
View
Full
Document
This document was uploaded on 10/05/2010.
 Spring '09
 Algorithms

Click to edit the document details